Welcome back. In the previous lesson, you expressed positive integers as products of prime factors, keeping repeated primes through indices such as
That factorisation is now a tool rather than an endpoint. This lesson uses it to find the highest common factor (HCF) and lowest common multiple (LCM) of two or more integers. These ideas will later support simplifying fractions, working with algebraic factors, and solving problems involving repeating cycles or equal-sized groups.
Factors, multiples, and the two questions to distinguish
A factor divides a number exactly. For example, is a factor of , because
A multiple is obtained by multiplying a number by a whole number. For example, and are multiples of .
The difference matters:
| If the problem asks… | Think about… | Useful result |
|---|---|---|
| “What is the largest size that divides every quantity exactly?” | factors | HCF |
| “What is the first time or smallest amount that works for every quantity?” | multiples | LCM |
The highest common factor of two or more positive integers is the greatest positive integer that divides every number exactly.
For example, the factors of and are:
Their common factors are and . Therefore,
The lowest common multiple is the smallest positive integer that is a multiple of every given number. The multiples of and begin as:
The first positive multiple they share is , so
For small numbers, listing factors or multiples is a sensible way to see the ideas. For larger numbers, however, prime factorisation is more reliable and much faster.
Watch “HCF and LCM” from Maths Genie for a visual introduction to both approaches: listing factors and multiples for small numbers, then using prime factorisation and a Venn diagram for larger numbers.
Watch the listing method to distinguish factors from multiples and see why “highest” and “lowest” matter. Then watch the prime method, focusing on how common prime factors determine the HCF while all required prime factors determine the LCM.
Seeing prime factors as shared and unshared “ingredients”
Suppose we want both the HCF and LCM of and .
First prime-factorise:
and
The numbers share one and one . The extra belongs only to ; the belongs only to .
The diagram provides two complementary readings:
- To find the HCF, multiply only the factors in the overlap:
- To find the LCM, multiply every prime factor appearing anywhere in the diagram, but only once per displayed copy:
Check the meanings:
so divides both numbers. Also,
so is a multiple of both numbers.
The Venn diagram is not just a memory trick. It represents a central fact:
- The HCF contains only prime factors that every number can supply.
- The LCM contains every prime factor that at least one number requires.
The prime-factorisation method: minimum exponents and maximum exponents
A Venn diagram is useful for two numbers, but an exponent table is clearer once factors repeat or three or more integers are involved.
Consider and .
Write every prime that appears in either factorisation. A missing prime has exponent .
| Prime | Exponent in | Exponent in | HCF exponent | LCM exponent |
|---|---|---|---|---|
| not included | ||||
| not included | ||||
For the HCF, take the smallest exponent for each prime, but only if that exponent is positive:
For the LCM, take the largest exponent for every prime that appears:
Why minimum for HCF?
A common factor must divide both numbers. It cannot contain more copies of a prime than the number with fewer copies.
For instance, contains , not . Therefore a common factor cannot contain , even though does. The most both numbers can supply is .
Why maximum for LCM?
A common multiple must be divisible by both numbers. Since contains , the LCM must contain at least . Taking fewer copies would prevent divisibility by . Taking more copies would create a larger multiple than necessary.
So the two rules are exact opposites:
A dependable written method is:
- Prime-factorise every integer.
- List each prime appearing in at least one factorisation.
- For the HCF, keep only primes appearing in every factorisation and select their smallest exponents.
- For the LCM, keep every listed prime and select its largest exponent.
- Multiply and check divisibility.
Interpreting HCF and LCM in context
The arithmetic method is the same, but the wording of a problem tells you which result is needed.
An HCF problem usually involves equal division with no remainder, together with a request for the greatest possible size, length, or number of groups.
For example, a rectangular floor is by . What is the largest square tile side length that covers the floor without cutting tiles?
The common primes with the smallest exponents are , , and :
So the largest possible square tile has side length
An LCM problem usually involves repeating intervals, synchronisation, or the smallest shared total.
Suppose one event happens every days and another happens every days. If both happen today, when will they next happen together?
Take every prime at its largest required exponent:
They next coincide after
3.1 Prime and Composite Numbers - Contemporary Mathematics | OpenStax
Read these examples from OpenStax to connect the calculations to equal-group and repeating-cycle situations. Notice that the mathematical question is determined by the constraint in the situation, not merely by keywords.
In the section “Applications of the Greatest Common Divisor,” read from the application introduction and examples. Focus on why the tile size and equal shelf capacity must divide every quantity exactly. Then, in “Finding the Least Common Multiple,” read the definition and list-based intuition. Continue to the prime-factorisation procedure, comparing its use of largest exponents with the HCF method’s smallest exponents.
Extending the method to three integers
The prime-factor method scales directly to three or more integers.
Find the HCF and LCM of , , and .
Every number contains one factor and one factor . No other prime occurs in all three factorisations. Therefore,
For the LCM, include all primes needed by at least one number, using the largest exponent required:
A fast check confirms the LCM:
Each quotient is a whole number, so is a common multiple. Because no prime exponent was made larger than necessary, it is the least common multiple.
Checks and common errors
Before accepting an answer, use the definition to check it.
For an HCF:
- Does it divide every given integer exactly?
- Is there a larger common factor?
- If the HCF is , are the numbers coprime? Coprime means their only positive common factor is .
For an LCM:
- Is it divisible by every given integer?
- Did you include every prime needed by at least one number?
- Did you use the largest exponent, rather than multiplying repeated prime factors unnecessarily?
The most frequent errors are these:
| Error | Why it fails | Correction |
|---|---|---|
| Using the largest exponent for the HCF | One number may not contain enough copies of that prime. | Use the smallest shared exponent. |
| Using the smallest exponent for the LCM | The result may fail to be divisible by one of the numbers. | Use the largest exponent needed. |
| Omitting a prime that appears in only one factorisation | The LCM then cannot be divisible by that number. | Include all primes for the LCM. |
| Multiplying the original integers to get the LCM | This produces a common multiple, but often not the least one. | Combine prime factors using maximum exponents. |
| Confusing group count with items per group | The HCF often gives the greatest number of equal groups; division then gives the contents of each group. | State what the HCF represents in context. |
For two positive integers only, there is also a useful verification identity:
For and ,
This is a check, not the main method. It does not extend in the same simple form to three or more integers.
In your error log, record the reason for any incorrect result. For example, write “used in the HCF although one number contained only ” rather than simply “HCF error.” That diagnosis is what makes later review effective.
Key takeaways
HCF and LCM are built from the same prime factorisations but answer opposite structural questions.
- The HCF is the largest number that divides every given integer exactly.
- The LCM is the smallest positive number divisible by every given integer.
- For small values, lists of factors or multiples can reveal the answer.
- For larger values, prime factorisation is the systematic method.
- For the HCF, use only shared primes and take the smallest exponent.
- For the LCM, use every prime that appears and take the largest exponent.
- Equal sharing, largest tiles, and longest exact cuts point to HCF.
- Repeating schedules, first coincidences, and minimum shared lengths point to LCM.
Next, you will use prime factorisation once more, this time to determine exact square roots and cube roots by grouping repeated prime factors.
Can't find a good explanation? Sign up and we'll make it for you
Sign up