Prime factorisation and the Fundamental Theorem · Mathematics Class 9–10 | StemPy Lab
Course 2.1·Lesson 1 of 3
Prime factorisation and the Fundamental Theorem
Every whole number greater than 1 is a prime or a product of primes. A factor tree or repeated division finds them. The Fundamental Theorem of Arithmetic says that there is exactly one such product, apart from the order. That is why a power of 6 can never end in 0.
about 30 min1 simulation2 practice questions1 Python program5 questions to check yourself
This lesson is free to read. Enroll free to keep your place and take the tests.
Lesson 1 of 3Show all lessonsHide
Try the code and the simulations beside the lesson.
The building blocks
A prime number has exactly two factors: 1 and itself. The first primes are 2,3,5,7,11,13,17,19,23. A whole number greater than 1 that is not prime is composite. It can be split into smaller factors.
The number 1 has only one factor, so it is neither prime nor composite.
Keep splitting a composite number, and you always end with primes. Primes are the building blocks of all whole numbers, as atoms are the building blocks of matter.
A factor tree
Write the number at the top. Split it into two factors. Split again any factor that is not prime. Stop when every branch ends in a prime.
A factor tree of 840. 840 splits into 2 and 420, 420 into 2 and 210, 210 into 2 and 105, 105 into 3 and 35, and 35 into 5 and 7. The primes 2, 2, 2, 3, 5 and 7 are circled. Below: 840 = 2 × 2 × 2 × 3 × 5 × 7 = 2³ × 3 × 5 × 7.
So 840=2×2×2×3×5×7=23×3×5×7. This is the prime factorisation of 840. We write repeated primes as powers, smallest prime first.
Repeated division
The same work, set out in a column, is often quicker. Divide by 2 as many times as you can, then by 3, then by 5, and so on.
1260÷2=630
630÷2=315
315÷3=105
105÷3=35
35÷5=7, and 7 is prime.
So 1260=22×32×5×7.
A short cut. You only need to try primes p with p×p not more than what is left. If no such prime divides it, what is left is itself a prime. For 91, try 2,3,5,7: 91=7×13. For 97, none of 2,3,5,7 divides it, and 11×11=121 is already too big. So 97 is prime.
The Fundamental Theorem of Arithmetic
Two students factorise 840. One starts with 840=8×105, the other with 840=20×42. They follow different trees. Yet both end with the same primes: three 2s, one 3, one 5 and one 7.
This always happens. It is so important that it has a grand name.
The Fundamental Theorem of Arithmetic. Every composite number can be written as a product of primes, and this product is unique, apart from the order of the primes.
Now you can see why 1 is not called a prime. If it were, we could write 6=2×3=1×2×3=1×1×2×3, and the product would not be unique.
Why it matters: can 6n end in 0?
A number ends in 0 exactly when 10 divides it. Since 10=2×5, its prime factorisation must hold a 2and a 5.
Now 6n=(2×3)n=2n×3n. Its only primes are 2 and 3. By the theorem, there is no other way to break it into primes, so a 5 can never appear. No power of 6 ends in 0.
A worked example. Can 15n end in 0 for some natural number n?
The primes.15n=3n×5n.
What is missing. A 5 is there, but there is no 2.
The answer. By the uniqueness of the factorisation, a 2 can never appear. So 15n never ends in 0. (It always ends in 5.)
Practise with new numbers
Try it in Python
This program breaks each number into primes by repeated division, and writes the powers.
Common mistakes
Calling 1 a prime. It has only one factor. The theorem would fail if 1 were a prime.
Stopping at a composite factor.840=8×105 is true, but it is not the prime factorisation. Keep splitting 8 and 105.
Losing repeated primes.60=2×3×5 is wrong, since 2×3×5=30. The answer is 60=22×3×5.
Guessing that a number is prime.91 and 221 look prime, but 91=7×13 and 221=13×17.
Remember these
A prime has exactly two factors. 1 is neither prime nor composite.
A factor tree or repeated division gives the prime factorisation. Write it with powers, smallest prime first.
The Fundamental Theorem of Arithmetic: every composite number is a product of primes in exactly one way, apart from the order.
A number ends in 0 only if its primes include both 2 and 5.
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Write 294 as a product of primes.
Is 1 a prime number? Why does the theorem need the answer?
Can 4n end in the digit 0 for any natural number n?
A number has the prime factorisation 23×3×11. What is the number?
Kabir writes 180=2×90 and says that he has the prime factorisation. Is he right?
Enroll free in Primes, HCF and LCM
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.