Prime Factorisation
Fundamental Theorem of Arithmetic
Fundamental Theorem of Arithmetic
Prime numbers are often considered the building blocks of integers. The fundamental theorem of arithmetic states every integer greater than 1 is either a prime number of can be expressed as a unique product of prime numbers.
Prime numbers are often considered the building blocks of integers. The fundamental theorem of arithmetic states every integer greater than 1 is either a prime number of can be expressed as a unique product of prime numbers.
The Ladder Method
The Ladder Method
To prime factorise a number, we use an algorithm known as the ladder method. The flow chart below summarises the steps.
To prime factorise a number, we use an algorithm known as the ladder method. The flow chart below summarises the steps.
Explore!
Explore!
Use the calculator below to prime factorise numbers up to 1000.
Use the calculator below to prime factorise numbers up to 1000.
Test yourself!
Test yourself!
Check your understanding by trying some of the randomly generated questions below.
Check your understanding by trying some of the randomly generated questions below.
Tick the check box to reveal the answer. Toggle the slider to raise the difficulty.
Tick the check box to reveal the answer. Toggle the slider to raise the difficulty.