• Foundation
  • About 15 min
  • 5 practice questions

Prime factorisation and the Fundamental Theorem of Arithmetic

Write any composite number as a product of primes in index form, state the Fundamental Theorem of Arithmetic in your own words, and use it to decide whether a number such as 6ⁿ can end in the digit 0.

If something looks wrong, please tell us.

By the end of this lesson you can

  • Break a composite number into its prime factors by repeated division and write the result with powers.
  • State the Fundamental Theorem of Arithmetic and explain what 'unique' means in it.
  • Use the uniqueness of prime factorisation to answer questions like 'can 6ⁿ end in 0?'.

In Class 9 you met the real numbers: the rational numbers together with irrational numbers such as √2 and π. This chapter goes deeper into the whole numbers that sit inside them. The single most useful fact about positive integers is that every one of them is built out of primes in exactly one way. That fact powers everything else in the chapter: finding HCF and LCM, and proving that numbers like √2 and √3 are irrational.

Primes and composites: a quick recap

A prime number has exactly two factors, 1 and itself: 2, 3, 5, 7, 11, 13, 17 and so on. A composite number has more than two factors, such as 12 (factors 1, 2, 3, 4, 6, 12). The number 1 is neither prime nor composite, because it has only one factor. Note that 2 is the only even prime.

Breaking a number into primes

To find the prime factors of a number, divide it by the smallest prime that goes into it exactly, then repeat with the quotient until you reach 1 or a prime. The primes you divided by, together with the last prime, are the prime factors.

Repeated division of 1260 by primes

  1. 1260 ÷ 2 = 630 1260 is even, so start with 2.
  2. 630 ÷ 2 = 315 Still even, divide by 2 again.
  3. 315 ÷ 3 = 105 Digit sum 9, so 3 divides it.
  4. 105 ÷ 3 = 35 Digit sum 6, so 3 divides it again.
  5. 35 ÷ 5 = 7 Ends in 5, so 5 divides it.
  6. 7 is prime: stop 1260 = 2 × 2 × 3 × 3 × 5 × 7
Always try the smallest prime first; the order of the primes does not change the answer.

Worked example 1: factorise 1260

Working: from the divisions above, 1260 = 2 × 2 × 3 × 3 × 5 × 7. Grouping equal primes as powers gives 1260 = 2² × 3² × 5 × 7. Check by multiplying back: 2² × 3² = 4 × 9 = 36; 36 × 5 = 180; 180 × 7 = 1260. Correct.

Worked example 2: factorise 8008

Working: 8008 ÷ 2 = 4004; 4004 ÷ 2 = 2002; 2002 ÷ 2 = 1001. Now 1001 is odd and its digit sum is 2, so neither 2 nor 3 divides it, and it does not end in 0 or 5. Try 7: 1001 ÷ 7 = 143. Then 143 ÷ 11 = 13, and 13 is prime. So 8008 = 2³ × 7 × 11 × 13. Check: 2³ × 7 = 56; 56 × 11 = 616; 616 × 13 = 8008. Correct.

The Fundamental Theorem of Arithmetic

Fundamental Theorem of Arithmetic: every composite number can be written as a product of primes, and this product is unique except for the order in which the primes are written.

— Real Numbers - key theorem

The word unique is the heart of the theorem. Whether you start 1260 by dividing by 2, by 5 or by 7, you always end with the same collection of primes: two 2s, two 3s, one 5 and one 7. Writing 7 × 5 × 3² × 2² instead of 2² × 3² × 5 × 7 is the same factorisation in a different order. By convention we write the primes in ascending order, and then there is only one way to write it.

Some numbers written as products of prime powers
NumberPrime factorisation (index form)Check
722³ × 3²8 × 9 = 72
1802² × 3² × 54 × 9 × 5 = 180
2862 × 11 × 132 × 143 = 286
10017 × 11 × 137 × 143 = 1001

Using uniqueness: which powers can end in 0?

A number ends in the digit 0 exactly when it is divisible by 10 = 2 × 5. So its prime factorisation must contain both the prime 2 and the prime 5. Uniqueness tells us we cannot get a 5 'from somewhere else' if it is not in the factorisation.

Worked example 3: can 6ⁿ end in 0?

Working: 6 = 2 × 3, so 6ⁿ = 2ⁿ × 3ⁿ. The only primes in this factorisation are 2 and 3. By the Fundamental Theorem of Arithmetic this factorisation is the only one, so 5 never appears. Without a factor 5, 6ⁿ is not divisible by 10, so 6ⁿ never ends in 0 for any natural number n. You can test small cases: 6, 36, 216, 1296 all end in 6.

Worked example 4: can 15ⁿ end in 0?

Working: 15ⁿ = 3ⁿ × 5ⁿ. This time 5 is present, but 2 is missing, so 15ⁿ is always odd and cannot end in 0. In contrast 20ⁿ = 2²ⁿ × 5ⁿ contains both 2 and 5, so 20ⁿ always ends in 0.

Key takeaways: factorise by dividing repeatedly by the smallest prime that works, then write equal primes as powers. The Fundamental Theorem of Arithmetic says this prime factorisation exists for every composite number and is unique apart from order. To end in 0, a number's factorisation must contain both 2 and 5.

Check your understanding

  1. 1. What is the prime factorisation of 3150?

    1. 2² × 3² × 5 × 7
    2. 2 × 3² × 5² × 7
    3. 2 × 3 × 5² × 7
    4. 2 × 3² × 5 × 7²
    Show answer

    Answer: B. 3150 ÷ 2 = 1575; 1575 ÷ 3 = 525; 525 ÷ 3 = 175; 175 ÷ 5 = 35; 35 ÷ 5 = 7. So 3150 = 2 × 3² × 5² × 7. Check: 2 × 9 × 25 × 7 = 18 × 175 = 3150. The other products give 1260, 1050 and 4410.

  2. 2. Which statement is the Fundamental Theorem of Arithmetic?

    1. Every number has exactly two factors
    2. Every even number is the sum of two primes
    3. The product of two primes is always prime
    4. Every composite number can be written as a product of primes in exactly one way, apart from the order of the factors
    Show answer

    Answer: D. The theorem has two parts: a prime factorisation always exists for a composite number, and it is unique except for the order of the primes. The other statements are either false or are different ideas altogether.

  3. 3. For how many natural numbers n does 8ⁿ end in the digit 0?

    1. None
    2. Only n = 5
    3. Every even n
    4. Every n greater than 10
    Show answer

    Answer: A. 8ⁿ = 2³ⁿ, so its only prime factor is 2. To end in 0 a number needs both 2 and 5 as prime factors. By uniqueness of prime factorisation, 5 never appears, so 8ⁿ never ends in 0.

  4. 4. Which number has the prime factorisation 2² × 3 × 7²?

    1. 294
    2. 1176
    3. 588
    4. 420
    Show answer

    Answer: C. 2² × 3 × 7² = 4 × 3 × 49 = 12 × 49 = 588. (294 is 2 × 3 × 7², and 1176 is 2³ × 3 × 7².)

  5. 5. Assertion (A): 12ⁿ can never end with the digit 0, for any natural number n.
    Reason (R): The prime factorisation of 12ⁿ contains no factor 5.

    1. Both A and R are true, and R is the correct explanation of A
    2. Both A and R are true, but R is not the correct explanation of A
    3. A is true, but R is false
    4. A is false, but R is true
    Show answer

    Answer: A. 12ⁿ = 2²ⁿ × 3ⁿ, so the only primes are 2 and 3, and R is true. A number ending in 0 must be divisible by 5, so A is true, and it is true precisely because 5 is missing, so R explains A.

Privacy · Terms · Refunds · Delivery