40% off

Early-bird ends 15 Aug, 9am

Lock in £90

Prime Factorisation Factors and Multiples for the TMUA

Updated August 2025

This section covers essential number theory concepts including prime factorisation, Highest Common Factor (HCF), and Lowest Common Multiple (LCM). Understanding these properties is vital for the TMUA, as they underpin complex algebraic manipulations and proofs. A concrete fact is that every integer greater than 1 has a unique prime factorisation.

Core concept

The Unique Factorisation Theorem states that every integer greater than 1 can be expressed as a unique product of prime numbers. This representation allows for the systematic determination of all factors and multiples of a number.

Multiples and Common Multiples

A multiple of a number is a value found in the times table of that specific number. A common multiple for two or more numbers is a value that is a multiple of all of those numbers. The Lowest Common Multiple (LCM) is the smallest positive number that is divisible by all the numbers in a given set.

Example: Finding common multiples

Find the first three common multiples of 66 and 88.

  1. Multiples of 66: 6,12,18,24,30,36,42,48,54,60,66,72...6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72...
  2. Multiples of 88: 8,16,24,32,40,48,56,64,72,80,88,96...8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96...
  3. Common multiples: 24,48,72...24, 48, 72...

Factors and Common Factors

A factor (also known as a divisor) of a number is a value that divides into that number exactly, leaving no remainder. A common factor is a number that divides exactly into all the numbers in a set. The Highest Common Factor (HCF) is the largest number that divides exactly into all the numbers provided.

Example: Finding common factors of two or more numbers

Find all the common factors of 1212 and 1818.

  1. Factors of 1212: 1,2,3,4,6,121, 2, 3, 4, 6, 12
  2. Factors of 1818: 1,2,3,6,9,181, 2, 3, 6, 9, 18
  3. Common factors: 1,2,3,61, 2, 3, 6

Prime Numbers and Factorisation

Prime numbers are integers that possess exactly two factors: 11 and the number itself. Prime factorisation is the process of writing a number as a product of its prime factors. The Unique Factorisation Theorem (Fundamental Theorem of Arithmetic) guarantees that every integer greater than 11 has a unique prime factorisation, regardless of the order of the factors.

Divisibility Tests

Divisibility tests are useful for identifying factors quickly:

  1. 2: The last digit is even.
  2. 3: The sum of the digits is divisible by 33.
  3. 4: The last two digits form a number divisible by 44.
  4. 5: The last digit is 00 or 55.
  5. 6: The number is divisible by both 22 and 33.
  6. 7: Subtract two times the last digit from the rest of the number: if the result is divisible by 77, the original is too. For example, for 546546, calculate 54(6×2)=4254 - (6 \times 2) = 42. Since 4242 is a multiple of 77, 546546 is also a multiple of 77.
  7. 8: The last three digits form a number divisible by 88.
  8. 9: The sum of the digits is divisible by 99.

Example: Deciding if a number is prime

Is 153153 a prime number? Sum of digits: 1+5+3=91 + 5 + 3 = 9. Since 99 is divisible by 33, 153153 is divisible by 33. It has more than two factors (at least 1,3,1531, 3, 153), so it is not prime.

Important Prime Facts

  1. There are 10 primes less than 30: 2,3,5,7,11,13,17,19,23,292, 3, 5, 7, 11, 13, 17, 19, 23, 29.
  2. The number 11 is not prime as it only has one factor.
  3. The number 22 is the only even prime.
  4. Apart from 22 and 55, all primes end in 1,3,7,1, 3, 7, or 99.

Prime Factorisation Methods

Example: Writing prime factorisation in index form

Write 180180 as a product of prime factors using index notation.

Method 1: Repeated Division (Ladder)

Divide 180180 by the smallest prime 22 to get 9090. Divide 9090 by 22 to get 4545. Divide 4545 by 33 to get 1515. Divide 1515 by 33 to get 55. Stop as 55 is prime. 180=2×2×3×3×5=22×32×5180 = 2 \times 2 \times 3 \times 3 \times 5 = 2^2 \times 3^2 \times 5.

Method 2: Factor Tree

Factor tree for 180

As shown in the diagram, circle prime numbers at the end of each branch. The product of the circled numbers is 22×32×52^2 \times 3^2 \times 5.

Finding HCF and LCM Using Prime Factorisation

Example: Finding the HCF and LCM of 180 and 420

  1. Prime factorisations: 180=2×2×3×3×5180 = 2 \times 2 \times 3 \times 3 \times 5 420=2×2×3×5×7420 = 2 \times 2 \times 3 \times 5 \times 7

  2. Use a Venn diagram to find the overlap: Venn diagram for HCF and LCM

  3. HCF: Multiply the numbers in the overlap: 2×2×3×5=602 \times 2 \times 3 \times 5 = 60.

  4. LCM: Multiply all numbers in the diagram: 2×2×3×3×5×7=12602 \times 2 \times 3 \times 3 \times 5 \times 7 = 1260.

Check: HCF×LCM=60×1260=75,600HCF \times LCM = 60 \times 1260 = 75,600. Also 180×420=75,600180 \times 420 = 75,600. The results match.

Example: HCF and LCM of three numbers (180, 168, and 72)

  1. 180=2×2×3×3×5180 = \underline{2} \times \underline{2} \times \underline{3} \times 3 \times 5
  2. 168=2×2×3×7168 = \underline{2} \times \underline{2} \times \underline{3} \times 7
  3. 72=2×2×2×3×372 = \underline{2} \times \underline{2} \times 2 \times \underline{3} \times 3

HCF: Find prime factors common to all: 2×2×3=122 \times 2 \times 3 = 12. LCM: Include the maximum occurrence of each prime factor. The max number of 22s is three (232^3), 33s is two (323^2), and one 55 and one 77. LCM=23×32×5×7=2520LCM = 2^3 \times 3^2 \times 5 \times 7 = 2520.

Solving Problems and Finding Square Roots

Example: Factor verification

Show that 210210 is a factor of 37803780. 210=2×3×5×7210 = 2 \times 3 \times 5 \times 7. 3780=22×33×5×7=(2×3×5×7)×(2×32)=210×183780 = 2^2 \times 3^3 \times 5 \times 7 = (2 \times 3 \times 5 \times 7) \times (2 \times 3^2) = 210 \times 18. Since all prime factors of 210210 are present in the factorisation of 37803780, it is a factor.

Example: Solving logic problems with primes

Sarah reverses the digits of a 2 digit number and subtracts it from the original. Can the answer be prime? Let the original number be 10y+x10y + x. The reversed is 10x+y10x + y. The difference is 10y+x(10x+y)=9y9x=9(yx)10y + x - (10x + y) = 9y - 9x = 9(y - x). Since this is a multiple of 99, it cannot be prime (unless it is 99, but 99 is not prime).

Example: Finding square roots

Given 129,600=26×34×52129,600 = 2^6 \times 3^4 \times 5^2, find 129,600\sqrt{129,600}. Halve the indices: 26/2×34/2×52/2=23×32×5=8×9×5=3602^{6/2} \times 3^{4/2} \times 5^{2/2} = 2^3 \times 3^2 \times 5 = 8 \times 9 \times 5 = 360.

Key takeaways

  • The Highest Common Factor (HCF) is the product of the lowest powers of all common prime factors.
  • The Lowest Common Multiple (LCM) is the product of the highest powers of all prime factors present in any of the numbers.
  • HCF multiplied by LCM of two numbers always equals the product of the two numbers themselves.
  • A number is prime if and only if it has exactly two factors: 1 and itself.
  • Divisibility tests are vital for efficient prime factorisation in non-calculator exams.
Tips

For TMUA questions involving large squares, always perform prime factorisation first. If every prime factor has an even index, the number is a perfect square. To find the square root, simply divide all indices by 2.

Cautions

Be careful when identifying the LCM of three numbers. It is not always the product of the numbers divided by the HCF. Use the maximum-power method or a 3-ring Venn diagram to ensure accuracy.

Insight

The relationship between HCF and LCM (HCF(a,b)×LCM(a,b)=a×bHCF(a, b) \times LCM(a, b) = a \times b) is a fundamental property in number theory that often provides a shortcut in problems involving ratios or gear-tooth rotations.

Worked Examples

Example 1
Sequence 1 is an arithmetic progression with first term 11 and common difference 3.
Sequence 2 is an arithmetic progression with first term 2 and common difference 5.
Some numbers that appear in Sequence 1 also appear in Sequence 2. Let
NN be the 20th such number.
What is the remainder when
NN is divided by 7?
A:0
B:1
C:2
D:3
E:4
F:5
G:6

Practice Questions

Practice Question 1
Consider the following statement about the positive integers a,ba, b and nn:
():ab(*): ab is divisible by nn
The condition 'either
aa or bb is divisible by nn' is:
A:necessary but not sufficient for ()(*)
B:sufficient but not necessary for ()(*)
C:necessary and sufficient for ()(*)
D:not necessary and not sufficient for ()(*)

Frequently asked questions

Is 1 a prime number?

No, 1 is not a prime number. By definition, a prime number must have exactly two distinct factors. 1 only has one factor (itself), so it is not prime.

How can I find the LCM of three numbers without a Venn diagram?

Find the prime factorisation of each number. For every prime that appears in any of the factorisations, take the highest power of that prime. Multiply these highest powers together to get the LCM.

Can the HCF of two numbers be larger than the numbers themselves?

No, the Highest Common Factor must be less than or equal to the smallest number in the set, as it must divide into them exactly.

Does the Unique Factorisation Theorem apply to negative integers?

The theorem usually refers to positive integers greater than 1. However, negative integers can be treated as 1-1 multiplied by the unique prime factorisation of their absolute value.

Ready to test your knowledge?

You've reached the end of this section. Start a practice session to solidify your understanding and master this topic.