1.02c - Highest factors and lowest multiples
Common factors help you share or cut exactly; common multiples help you match repeating quantities. You will find the highest common factor and lowest common multiple using lists and prime factorisations, then choose between them in context.
Common factors and multiples
Two bells ring every eighteen seconds and every thirty seconds, starting together. When will they next ring together? The answer must be a multiple of both intervals, rather than a factor of them.
For smaller numbers, lists make the difference visible. The factors of are ; its positive multiples begin . A factor divides into the number. A multiple contains whole copies of it.
HCF and LCM
The highest common factor (HCF) of positive integers is the greatest positive integer that divides every one of them exactly. The lowest common multiple (LCM) is the smallest positive integer that is a multiple of every one of them. Zero is a common multiple, but is excluded by “positive” in the LCM definition.
For an HCF, list all positive factors and choose the greatest shared value. For an LCM, list increasing positive multiples until you find the first shared value. Do not simply choose the largest number written down.
Worked example 1: comparing twelve and eighteen
Question. Find the HCF and LCM of and by listing.
Plan. Compare factor lists for the HCF, and increasing multiple lists for the LCM.
Answer. HCF ; LCM .
Check. and . Also, and . The complete factor lists and increasing multiples establish highest and lowest.
Keep twelve and change only the second number to twenty. Neither answer should be carried over without comparing again.
Worked example 2: comparing twelve and twenty
Question. Find the HCF and LCM of and by listing.
Plan. Keep the factors of twelve, list the new factors and extend the multiples as far as needed.
Answer. HCF ; LCM .
Check. Four divides both numbers, and sixty is divisible by each. The lists show no larger common factor or smaller positive common multiple.
Two useful boundaries follow from the definitions. If the numbers have no common factor above one, their HCF is one. If one number divides the other, the smaller is the HCF and the larger is the LCM: for and , they are and . Equal positive numbers have that same number as both HCF and LCM.
Watch out
An LCM is a multiple of each original number, not necessarily their product. For twelve and eighteen, is a common multiple but the LCM is .
Change the second number once more and compare the lists.
Choosing prime powers
Prime factorisation makes the same comparison without writing long multiple lists.
Consider and . A common factor can use only primes present in both numbers, and no more copies than either number contains. It can therefore contain two twos and one three, but neither five nor seven.
A common multiple must contain enough prime factors to include each original number. It needs two twos, two threes, one five and one seven. Shared copies need not be counted twice: the same two twos can serve both originals.
Key idea
For the HCF, take each shared prime to the smaller power. For the LCM, take every prime present to the larger power. A missing prime contributes nothing to the HCF, but must still be included in the LCM if the other number needs it.
These choices explain why the answers are highest and lowest. Another copy in the HCF would fail to divide at least one original. Removing a needed copy from the LCM would stop it being a multiple of at least one original.
Worked example 3: shared and unshared primes
Question. Given and , find their HCF and LCM.
Plan. Use the common copies for the HCF and enough copies for either number for the LCM.
Answer. HCF ; LCM .
Check. , ; , . Both answers have the required divisibility.
Keep eighty-four and change only the power of three in the second factorisation, from to . The second number becomes .
Worked example 4: one larger prime power
Question. Given and , find their HCF and LCM.
Plan. Reconsider the number of threes needed; all other prime comparisons stay the same.
Answer. HCF ; LCM .
Check. , , while twelve still divides both originals. The LCM tripled when the second number gained a factor of three.
For two positive integers, there is a useful connection: their HCF multiplied by their LCM equals their product. Each prime's copies are split into the smaller and larger counts, so together they use exactly the copies in the two originals. Here, . This gives a check, or a way to recover one answer from the other. The statement is for two numbers; do not apply it unchanged to three.
Watch out
For the LCM of eighty-four and one hundred and eighty, including only shared primes gives , which is not divisible by either original. Include the unshared five and seven too.
Change only the second number's power of three again.
Sharing and repeating cycles
Choose the method by asking what the required number must do: divide each given quantity exactly, or be reached by repeated copies of each quantity.
If lengths are cut into equal pieces without waste, the piece length must divide each original length, so factors matter. If events repeat and must coincide, the elapsed time must be a multiple of each interval. The words “greatest” and “next” then select the HCF or LCM.
| Requirement | Relationship | Choice |
|---|---|---|
| Longest equal pieces, no waste | Piece length divides each length | HCF |
| Greatest number of identical packs, nothing left | Number of packs divides each item count | HCF |
| Next simultaneous repeat | Elapsed time is a positive multiple of each interval | LCM |
For packs, “identical” means each pack has the same number of each kind of item. The HCF gives the number of packs; divide the original counts by it to find each pack's contents.
Worked example 5: the longest equal pieces
Question. Ropes of lengths and are cut into equal whole-metre lengths with no waste. Find the greatest possible piece length.
Plan. Find the HCF because the piece length must divide both rope lengths.
Answer. Each piece can be long.
Check. The ropes make pieces and pieces, with no waste. No greater common factor appears in the complete lists.
Keep the numbers eighteen and thirty, but change the requirement from dividing quantities to matching repeats. This reverses which relationship we need.
Worked example 6: the next simultaneous ring
Question. Two bells ring every seconds and every seconds. They ring together now. After how many seconds will they next ring together?
Plan. Find the first positive time that is a multiple of both intervals.
Answer. They next ring together after seconds.
Check. This is five intervals of eighteen seconds and three intervals of thirty seconds. The earlier positive thirty-second times, and , are not multiples of eighteen.
The opening bells therefore meet after ninety seconds. The answer six would divide both intervals, but would not be a ringing time for either bell after the start.
Watch out
Do not choose HCF just because the problem contains two whole numbers. State the relationship first: a piece length divides; a repeat time is a multiple. Include the context in the answer so its meaning is clear.
Find the next coincidence with new intervals.
Quick Recap
- The HCF is the greatest shared positive factor; the LCM is the smallest shared positive multiple.
- Lists suit smaller numbers. Prime factorisations compare repeated prime copies efficiently.
- Choose shared primes to smaller powers for the HCF; every required prime to its larger power for the LCM.
- Equal sharing or cutting uses divisors; coinciding repeats use multiples.
The bells next ring together after seconds, the LCM of eighteen and thirty.