N4, N5 - Primes, factors, multiples and systematic lists

N4, N5 - Primes, factors, multiples and systematic lists

Build whole numbers from prime factors, find shared factors and multiples, and choose the right method for grouping or repeating cycles. Organised lists will help you justify that you have found every possibility exactly once.

Prime factors and unique factorisation

A club has 7272 blue counters and 120120 green counters. What is the greatest number of identical packs it can make, using every counter? Prime factors will help us decide which pack counts are possible.

You already know

A power such as 232^3 records three equal factors. To check a factorisation, multiply the factors to reconstruct the original number.

A factor, or divisor, divides a number exactly. The positive factor pairs of 2424 are 1×241 \times 24, 2×122 \times 12, 3×83 \times 8 and 4×64 \times 6, giving factors 1,2,3,4,6,8,12,241, 2, 3, 4, 6, 8, 12, 24. A multiple is made by multiplying by an integer; the positive multiples of 2424 begin 24,48,72,9624, 48, 72, 96.

Prime number

A prime number is an integer greater than one with exactly two positive factors: one and itself. An integer greater than one with more than two positive factors is composite.

The primes begin 2,3,5,7,11,13,17,192, 3, 5, 7, 11, 13, 17, 19. One is not prime: it has only one positive factor. Two is the only even prime; every larger even number also has two as a factor.

A prime factorisation writes a whole number as a product of primes. Split composite factors until only primes remain. The unique factorisation theorem says that every integer greater than one has exactly one prime factorisation, apart from the order of its factors.

Worked example 1: splitting into primes

Question. Express 8484 as a product of powers of prime factors.

Plan. Split composite factors, then collect repeated primes as powers.

84=7×12choose a factor pair=7×3×4split the composite 12=7×3×2×2split the composite 4=22×3×7collect repeated primes\begin{aligned} 84 &= 7 \times 12 && \text{choose a factor pair} \\ &= 7 \times 3 \times 4 && \text{split the composite }12 \\ &= 7 \times 3 \times 2 \times 2 && \text{split the composite }4 \\ &= 2^2 \times 3 \times 7 && \text{collect repeated primes} \end{aligned}

Why continue past 7×127 \times 12? Every final factor must be prime; 1212 is composite.

Answer. 22×3×72^2 \times 3 \times 7.

Check. 4×3×7=844 \times 3 \times 7 = 84. Starting instead with 6×146 \times 14 produces the same primes.

Change only the input by doubling it. That adds one more factor of two.

Worked example 2: one extra prime factor

Question. Express 168168 as a product of powers of prime factors.

Plan. Separate a factor of two, then factorise 8484.

168=2×84halve the even number=2×22×3×7use the prime factors of 84=23×3×7combine the factors of two\begin{aligned} 168 &= 2 \times 84 && \text{halve the even number} \\ &= 2 \times 2^2 \times 3 \times 7 && \text{use the prime factors of }84 \\ &= 2^3 \times 3 \times 7 && \text{combine the factors of two} \end{aligned}

Why increase the index from two to three? Multiplying by two adds one occurrence of the prime; it does not double every prime in the product.

Answer. 23×3×72^3 \times 3 \times 7.

Check. 8×3×7=1688 \times 3 \times 7 = 168, and all three bases are prime.

Repeated division is another route. For 150150, divide successively by 2,3,5,52, 3, 5, 5, giving quotients 75,25,5,175, 25, 5, 1. Hence 150=2×3×52150 = 2 \times 3 \times 5^2. Stop only when the quotient is one.

Watch out

Wrong: calling 62×76^2 \times 7 a prime factorisation. Its value is 252252, but 66 is composite. Right: 252=22×32×7252 = 2^2 \times 3^2 \times 7.

Double the second example's input once more.

Highest common factors and lowest common multiples

Shared factors divide both numbers, while shared multiples can be made from whole copies of either number.

HCF and LCM

The highest common factor (HCF) is the greatest positive integer that divides every given number. The lowest common multiple (LCM) is the smallest positive integer that is a multiple of every given number.

For 1212 and 1818, the common factors are 1,2,3,61, 2, 3, 6, so the HCF is 66. Their positive multiple lists begin 12,24,36,48,60,7212, 24, 36, 48, 60, 72 and 18,36,54,7218, 36, 54, 72; the first shared value is 3636, so that is the LCM. Prime factorisation makes larger cases easier.

Worked example 3: shared and additional primes

Question. Find the HCF and LCM of 7272 and 120120.

Plan. Factorise both numbers. For the HCF take shared primes with their smaller exponents; for the LCM take every prime with its larger exponent.

72=23×32prime factorisation120=23×3×5prime factorisationHCF⁡(72,120)=23×3=24only the shared occurrencesLCM⁡(72,120)=23×32×5=360enough primes for both numbers\begin{aligned} 72 &= 2^3 \times 3^2 && \text{prime factorisation} \\ 120 &= 2^3 \times 3 \times 5 && \text{prime factorisation} \\ \operatorname{HCF}(72,120) &= 2^3 \times 3 = 24 && \text{only the shared occurrences} \\ \operatorname{LCM}(72,120) &= 2^3 \times 3^2 \times 5 = 360 && \text{enough primes for both numbers} \end{aligned}

Why use smaller exponents for the HCF? A factor cannot contain more copies of a prime than either original number contains.

Answer. HCF 2424; LCM 360360.

Check. 72÷24=372 \div 24 = 3, 120÷24=5120 \div 24 = 5, 360÷72=5360 \div 72 = 5 and 360÷120=3360 \div 120 = 3.

The overlapping diagram displays occurrences of primes, so its repeated twos matter.

[DIAGRAM: asset_name: Common and additional prime factors; asset_slug: 1ma1_m04_hcf_lcm; caption: The shared primes give the HCF; all the displayed primes give the LCM.; description: Overlapping sets labelled 72 and 120 show shared factors 2, 2, 2 and 3, an extra 3 for 72 and an extra 5 for 120. The shared product is 24 and the product of every displayed prime is 360.]
The shared primes give the HCF

Change only the second input from 120120 to 180180. Recheck which prime occurrences are shared.

Worked example 4: different shared exponents

Question. Find the HCF and LCM of 7272 and 180180.

Plan. Compare the prime exponents in the two factorisations.

72=23×32keep the first factorisation180=22×32×5factorise the new inputHCF⁡(72,180)=22×32=36smaller shared exponentsLCM⁡(72,180)=23×32×5=360larger exponents of all primes\begin{aligned} 72 &= 2^3 \times 3^2 && \text{keep the first factorisation} \\ 180 &= 2^2 \times 3^2 \times 5 && \text{factorise the new input} \\ \operatorname{HCF}(72,180) &= 2^2 \times 3^2 = 36 && \text{smaller shared exponents} \\ \operatorname{LCM}(72,180) &= 2^3 \times 3^2 \times 5 = 360 && \text{larger exponents of all primes} \end{aligned}

Why does the LCM stay 360360? The largest required exponent of every prime is unchanged, although the shared exponents have changed.

Answer. HCF 3636; LCM 360360.

Check. 72=2×3672 = 2 \times 36, 180=5×36180 = 5 \times 36, and 360360 divides by the two inputs to give 55 and 22.

If no prime is shared, the HCF is one and the LCM is the product of the inputs. If one positive input divides the other, the HCF is the smaller and the LCM is the larger.

Watch out

An HCF cannot exceed the smaller positive input, and an LCM cannot be below the larger input. If those checks fail, you may have swapped the two methods.

Change only the second input again.

Divisibility, grouping and repeating cycles

Decide whether the problem divides an existing stock into groups or looks for a future shared total.

A pack count must divide each stock, so identical packs use common factors. A shared repeat time must be a multiple of each interval, so repeating cycles use common multiples. “Greatest number of packs” points to HCF; “next together” points to LCM.

Worked example 5: greatest number of identical packs

Question. A club has 7272 blue counters and 120120 green counters. Find the greatest number of identical packs it can make using every counter, and state the contents of each pack.

Plan. Find the HCF for the pack count, then divide both stocks by it.

packs=HCF⁡(72,120)=24greatest shared divisorblue per pack=72÷24=3share the blue stock equallygreen per pack=120÷24=5share the green stock equally\begin{aligned} \text{packs} &= \operatorname{HCF}(72,120) = 24 && \text{greatest shared divisor} \\ \text{blue per pack} &= 72 \div 24 = 3 && \text{share the blue stock equally} \\ \text{green per pack} &= 120 \div 24 = 5 && \text{share the green stock equally} \end{aligned}

Why use HCF? Every pack count must divide both stocks exactly, and the question asks for the largest such count.

Answer. 2424 packs, each containing 33 blue and 55 green counters.

Check. 24×3=7224 \times 3 = 72 and 24×5=12024 \times 5 = 120; no counter is left over.

Change only the blue stock from 7272 to 9696. A bigger stock need not give more packs.

Worked example 6: changing one stock

Question. Find the greatest number of identical packs from 9696 blue counters and 120120 green counters, using every counter. State each pack's contents.

Plan. Recalculate the HCF before dividing the stocks.

96=25×3factorise the new stock120=23×3×5factorise the other stockpacks=23×3=24greatest shared divisorblue per pack=96÷24=4divide the stockgreen per pack=120÷24=5divide the stock\begin{aligned} 96 &= 2^5 \times 3 && \text{factorise the new stock} \\ 120 &= 2^3 \times 3 \times 5 && \text{factorise the other stock} \\ \text{packs} &= 2^3 \times 3 = 24 && \text{greatest shared divisor} \\ \text{blue per pack} &= 96 \div 24 = 4 && \text{divide the stock} \\ \text{green per pack} &= 120 \div 24 = 5 && \text{divide the stock} \end{aligned}

Why not assume the HCF increases? Extra factors in one stock help only if the other stock contains them too.

Answer. 2424 packs, each with 44 blue and 55 green counters.

Check. 24×4=9624 \times 4 = 96 and 24×5=12024 \times 5 = 120.

For cycles, suppose two lights flash together, then flash every 1212 and 1818 seconds. The first positive common multiple is 3636, so they next coincide after 36 s36\,\mathrm{s}. This assumes constant intervals and a shared start. The initial coincidence at zero is not the next one.

Prime powers also test divisibility without calculating the entire number. A number 24×32×52^4 \times 3^2 \times 5 is divisible by 12=22×312 = 2^2 \times 3, leaving 22×3×5=602^2 \times 3 \times 5 = 60. It is not divisible by 27=3327 = 3^3, since it has only two factors of three. Divisibility by ten requires factors of both two and five; decimal multiples of ten end in zero.

A square number has even exponents in its prime factorisation, because every factor is paired with its copy. Thus 24×32=1442^4 \times 3^2 = 144 is square, but 24×32×5=7202^4 \times 3^2 \times 5 = 720 is not. This is why you can recognise a huge square from its prime exponents without finding its value.

Watch out

The LCM 360360 cannot be the number of non-empty packs from stocks of 7272 and 120120. It exceeds both stocks. Decide what the required number must divide, or be divisible by, before calculating.

Change only the green stock in the second pack example.

Complete lists without duplication

A systematic list uses a fixed order so you can explain why nothing is missing or counted twice.

Fix one choice, list every allowed continuation, then move to the next first choice. For two-digit numbers, each tens digit gives one row. The rows cannot overlap because their tens digits differ.

Worked example 7: listing without repeated digits

Question. List all two-digit numbers made from 1,2,31, 2, 3, using each digit at most once in a number.

Plan. Fix the tens digit and list the possible units digits in increasing order.

tens 1:12, 13units 2 or 3tens 2:21, 23units 1 or 3tens 3:31, 32units 1 or 2total=2+2+2=6add the row counts\begin{aligned} \text{tens }1 &: 12,\ 13 && \text{units }2\text{ or }3 \\ \text{tens }2 &: 21,\ 23 && \text{units }1\text{ or }3 \\ \text{tens }3 &: 31,\ 32 && \text{units }1\text{ or }2 \\ \text{total} &= 2 + 2 + 2 = 6 && \text{add the row counts} \end{aligned}

Why are 1212 and 2121 both included? Changing digit order changes the number.

Answer. 12,13,21,23,31,3212, 13, 21, 23, 31, 32.

Check. Every allowed tens digit has a row, and each row uses both other digits exactly once.

Change only the repetition rule: digits may now repeat. Each row gains the number with two matching digits.

Worked example 8: allowing repeated digits

Question. List all two-digit numbers made from 1,2,31, 2, 3, allowing repeated digits.

Plan. Use the same row order and include every available units digit.

tens 1:11, 12, 13all three units digitstens 2:21, 22, 23all three units digitstens 3:31, 32, 33all three units digitstotal=3+3+3=9add the row counts\begin{aligned} \text{tens }1 &: 11,\ 12,\ 13 && \text{all three units digits} \\ \text{tens }2 &: 21,\ 22,\ 23 && \text{all three units digits} \\ \text{tens }3 &: 31,\ 32,\ 33 && \text{all three units digits} \\ \text{total} &= 3 + 3 + 3 = 9 && \text{add the row counts} \end{aligned}

Why do the rows now have three entries? Choosing the tens digit no longer forbids that digit in the units column.

Answer. 11,12,13,21,22,23,31,32,3311, 12, 13, 21, 22, 23, 31, 32, 33.

Check. The old six numbers remain, and exactly 11,22,3311, 22, 33 have been added.

Unordered selections need a different rule. For pairs from A, B and C, list only letters later in the alphabet after the first: AB, AC, then BC. BA is the same pair as AB. There are 2+1=32 + 1 = 3 unordered pairs.

For factor pairs of 3636, try divisors in increasing order: 1×361 \times 36, 2×182 \times 18, 3×123 \times 12, 4×94 \times 9, 6×66 \times 6. Stop when the next pairs would reverse earlier ones. The factor 66 appears once in the final factor list, even though it occurs twice in its pair.

Watch out

A plausible-looking list is not enough to establish completeness. Use a rule that covers every allowed first choice and every continuation. Check whether order and repetition matter before listing.

Keep repetition allowed and change just one available digit, from 33 to 44.

Quick Recap

  • Prime factorisation ends with prime bases and is unique apart from order.
  • HCF uses shared prime occurrences; LCM uses enough of every prime for both inputs.
  • Grouping stock uses factors; shared repeat times use multiples.
  • A fixed listing order shows completeness and prevents duplication.

The opening club can make 2424 identical packs, each with 33 blue and 55 green counters.