Procedure
Prime factorisation
Arithmetic • Number System • Factors and Divisors
Statement
Every integer has a unique factorisation with prime.
How to use it
- 1Divide by primes in increasing order until the quotient is .
- 2Stop testing once the trial divisor exceeds ; any remainder is prime.
- 3HCF takes the minimum exponent of each shared prime, LCM the maximum.
Worked example
Write as a product of primes.
Step-by-step
- 1
Why: Strip all factors of first.
- 2
- 3
Answer
Watch out
The number of divisors is , not .
Also known as
factor tree, express as product of primes