1. Primes, composites and factor trees
A prime number has exactly two factors, and itself: A composite number has more than two factors. The number is neither prime nor composite, and is the only even prime.
To factorise a composite number, split off primes repeatedly — by a factor tree or by repeated division — until only primes remain. Write the result with powers in increasing order of primes, e.g. .
Divisibility shortcuts help: (last digit even), (digit sum divisible by 3), (last digit 0 or 5), (alternating digit sum divisible by 11).
Formulas
- Example
Key terms
- Prime number
A natural number with exactly two factors, and itself.
- Composite number
A natural number greater than with more than two factors.
- Prime factorisation
Writing a number as a product of primes, e.g. .
2. The Fundamental Theorem of Arithmetic
Theorem. Every composite number can be expressed as a product of primes, and this factorisation is unique, apart from the order in which the primes occur.
Consequences you will use:
- A number ends in exactly when it is divisible by , so its factorisation must contain both and . Hence never ends in .
- Perfect square: every exponent even. Perfect cube: every exponent a multiple of . To make a square, multiply by .
- "Factorisations" such as are not prime factorisations; reduce every factor to primes.
Not in the 2026–27 syllabus: Euclid's division lemma and algorithm, and decimal expansions of rational numbers.
Formulas
- Standard form, primes in increasing order
Key terms
- Fundamental Theorem of Arithmetic
Every composite number is a product of primes in exactly one way, apart from order.
- Co-prime numbers
Numbers whose HCF is , e.g. and .
3. HCF and LCM by prime factorisation
- HCF (highest common factor) product of the common primes, each with its smaller power.
- LCM (lowest common multiple) product of all primes that occur, each with its greater power.
Working: and , so and .
For three numbers, use primes common to all three for the HCF: , .
An exponent table (one row per prime, power when a prime is missing) prevents slips.
Formulas
- m, n = powers of p in the two numbers
Key terms
- HCF
The largest number that divides each of the given numbers exactly.
- LCM
The smallest number that is a multiple of each of the given numbers.
4. HCF × LCM = product (two numbers only)
For any two natural numbers and , , because for each prime .
Use it to find a missing number: if , and one number is , the other is .
It fails for three numbers: for , , but .
Useful facts: the HCF always divides the LCM; co-prime numbers have and product; consecutive numbers are co-prime.
| Numbers | HCF | LCM | HCF × LCM | Product |
|---|---|---|---|---|
Formulas
- Two numbers only
Key terms
- Product rule
for two numbers.
5. Word problems on HCF and LCM
HCF problems ask for the largest size that divides several quantities exactly: cutting ribbons or rods, packing sweets, tiling floors with square tiles, arranging groups in equal rows, spacing poles.
LCM problems ask for the smallest quantity or the first time at which events coincide: bells ringing together, buses or trains leaving together, runners meeting at the start, lights blinking together.
Remainder variants: "largest number dividing 245 and 1029 leaving remainders 5 and 9" → HCF of and . "Smallest number leaving remainder 5 when divided by 12, 16, 24, 36" → LCM .
Always finish with what is asked: the number of pieces, a clock time, or a cost.
- Route 1 (every 18 min)
- Route 2 (every 24 min)
- Route 3 (every 30 min)
Formulas
- Number of equal pieces
Key terms
- Common multiple
A number that each given number divides exactly; the LCM is the smallest.
6. Rational and irrational numbers
A number is rational if it can be written as , where and are integers and . A real number that is not rational is irrational. Examples of irrationals: . The square root of a natural number that is not a perfect square is irrational; is rational.
Irrational numbers are real lengths: the diagonal of a m square tile is m, and can be marked on the number line with a compass.
is irrational; and are only approximations.
Key terms
- Rational number
A number of the form , integers, .
- Irrational number
A real number that cannot be written as .
7. Proving that √2, √3 and √5 are irrational
Key fact. If a prime divides , then divides . (By uniqueness of factorisation, has the same primes as .) It is false for non-primes: divides but not .
Proof that is irrational. Suppose with co-prime and . Then , so and hence ; write . Then , i.e. , so and . Thus divides both and , contradicting co-primality. So is irrational.
The same steps with or prove and irrational.
Formulas
- The proof chain (p prime)
Key terms
- Proof by contradiction
Assume the opposite of the statement, reason correctly to an impossibility, and conclude the assumption was false.
8. Sums and products with irrational numbers
If is rational and is irrational:
- and are irrational;
- and are irrational when .
Method for "prove is irrational": suppose it equals a rational ; then would be rational, a contradiction.
Two irrationals can give a rational: , , . Simplify before classifying.
| Combination | Result | Example |
|---|---|---|
| rational + irrational | irrational | |
| non-zero rational × irrational | irrational | |
| irrational + irrational | either | |
| irrational × irrational | either |
Formulas
- Product of conjugates is rational
Key terms
- Surd
An irrational root such as or .
Exam tips
How marks are awarded
- HCF/LCM (2–3 marks): prime factorisations 1, HCF and LCM 1, verification or final answer 1. Answers without factorisations can lose the method mark.
- Word problems (3–5 marks): identifying HCF or LCM 1, factorisations 1, value 1, answer in the asked form (pieces, clock time, cost) 1–2.
- Irrationality proofs (3 marks): assumption with co-prime ½, with "p is prime" 1, 1, contradiction and conclusion ½.
- Prove irrational (2–3 marks): assume rational, isolate the root, state the contradiction.
Common mistakes
- Taking greater powers for the HCF (that gives the LCM).
- Using HCF × LCM = product for three numbers.
- Writing or composite numbers in a prime factorisation.
- Stopping at the HCF when the number of pieces or boxes is asked.
- Forgetting "co-prime" in the assumption of an irrationality proof.
- Using "" for a non-prime .
- Claiming the sum or product of two irrationals is always irrational.
- Treating as .