FN4, HN4 - Highest common factors and lowest common multiples
Find the highest common factor and lowest common multiple using lists and prime factors. You will explain why the two methods use different prime powers, and decide which one solves a grouping or repeating-cycle problem.
Highest common factor
When two repeating schedules start together, when will they next coincide? To answer that later, first distinguish a number that divides both amounts from one that both amounts divide into.
The factors of include ; these are also factors of . A common factor divides each of the numbers exactly. We often need the greatest one.
Highest common factor
The highest common factor (HCF) of two or more positive integers is the largest positive integer that divides every one of them exactly.
Listing factors is a reliable starting method for small numbers. Write complete lists so that a missed factor cannot hide the highest shared value.
Worked example 1: HCF from factor lists
Question. Find the HCF of and .
Plan. List both sets of factors, identify their common factors, then select the largest.
Answer. The HCF is .
Check. and . The complete lists contain no larger common factor.
For larger numbers, compare their prime products. A common factor can use only primes found in both numbers. For each shared prime, use the smaller number of copies: the factor must divide the number with fewer copies too.
Worked example 2: HCF from prime factors
Question. Find the HCF of and .
Plan. Write prime factorisations and take the shared prime powers with the smaller indices.
Only one can be shared because has just one. Only one can be shared because has just one. Both have one .
Answer. .
Check. and . Those remaining factors share no factor greater than , so there is no additional common factor to include.
If the numbers have no shared prime, their HCF is . Such numbers are called coprime; they need not both be prime. For example, and are coprime.
Watch out
Taking the larger prime powers would give for the second example. That cannot be the HCF: it does not divide either number, and exceeds both of them.
Find a common divisor of a fresh pair using prime factors.
Lowest common multiple
A common multiple is a number that each starting number divides into exactly.
Multiples of are . Multiples of are . The first positive value in both lists is .
Lowest common multiple
The lowest common multiple (LCM) of two or more positive integers is their smallest positive common multiple. Zero is excluded, even though it is a multiple of every integer.
For small numbers, list positive multiples until the lists first meet. Continue far enough for the larger starting number to appear in its own list too.
Worked example 3: LCM from multiple lists
Question. Find the LCM of and .
Plan. List positive multiples in increasing order and find the first shared value.
Answer. The LCM is .
Check. and . The smaller multiples and of the larger number are not multiples of .
A prime-factor method avoids long lists. A common multiple must contain enough copies of each prime to include either original number. Use every prime that appears, with its larger index. Shared copies can serve both numbers, so they are not counted twice.
Worked example 4: LCM from prime powers
Question. Find the LCM of and .
Plan. Compare the prime factorisations and include the larger power of each prime.
Two copies of are needed to include ; two copies of are needed to include . One copy of serves both.
Answer. .
Check. . Removing any prime factor from the selected product would leave too few copies for at least one starting number, so this common multiple is the lowest.
If one number already divides the other, the larger number is their LCM: the LCM of and is . Multiplying the starting numbers always gives a common multiple, but it may be larger than necessary: , while their LCM is .
Key idea
HCF: shared primes, smaller powers. LCM: all primes present, larger powers. The first must divide each number; the second must be divisible by each number.
Find the smallest common multiple of a new pair.
Choosing a method
Choose HCF or LCM by deciding what the unknown number must do, rather than searching for one keyword.
If the unknown divides each amount into equal whole groups, it is a common factor. If it is reached after whole numbers of both repeating cycles, it is a common multiple. The requested largest or first value then selects HCF or LCM.
| Situation | What must be true? | Method |
|---|---|---|
| Greatest number of identical packs using everything | Number of packs divides each total | HCF |
| Largest equal lengths cut from two lengths, with no waste | Chosen length divides both original lengths | HCF |
| First repeat together after a shared start | Elapsed time is a multiple of both intervals | LCM |
First use the grouping interpretation. “Identical” means every pack has the same number of apples and the same number of pears; it does not mean apples and pears must occur in equal numbers within a pack.
Worked example 5: the greatest number of identical packs
Question. A stall has apples and pears. It makes the greatest possible number of identical packs using all the fruit. How many packs can it make, and what is in each pack?
Plan. Find the HCF for the number of packs, then divide each fruit total by it.
Answer. packs, each containing apples and pears.
Check. and , so all fruit is used. The HCF makes this the greatest possible number of packs.
Now change from dividing fixed totals to waiting for two repeating events. The unknown must contain whole cycles of both lengths.
Worked example 6: the next repeat together
Question. One bus service leaves every minutes and another every minutes. Both leave at . At what time do they next leave together?
Plan. Find the LCM of the intervals, then add that elapsed time to .
Answer. .
Check. In minutes the first service completes intervals and the second completes . At minutes only the second repeats, so that earlier time does not work.
The opening schedule question therefore needs a common multiple, because the elapsed time must contain a whole number of each interval. The shared start itself is time zero; “next” asks for the first positive common time.
Watch out
The HCF of and is , but neither bus has completed an interval after minutes. A divisor of the intervals cannot answer this repeating-cycle question.
Use the same decision with different intervals.
Quick Recap
- The HCF divides every starting number: use shared primes with their smaller powers.
- The LCM is divisible by every starting number: use all primes present with their larger powers.
- Equal groups with no leftovers point to a common factor; repeating cycles point to a common multiple.
Two schedules next coincide after their first positive common multiple of time intervals.