Prime and composite numbersUnderstandabout 45 min
Factors, primes and how to test them
Precise definitions, reliable methods and the mix-ups to avoid
Find every factor with the factor-pair method, sieve to 100 and see why you can stop at 7, test any number for primality by trial division up to its square root, use divisibility rules, and meet twin primes, co-primes and factor trees.
In this part you’ll
- Use the precise language of factors, multiples, divisors and divisibility.
- List every factor of a number using factor pairs and explain when to stop.
- Sieve to 100 and test a number for primality by dividing by primes up to its square root.
- Apply divisibility rules for 2, 3, 4, 5, 6, 8, 9, 10 and 11, and combine them only with co-prime pieces.
- Identify twin primes and co-prime pairs, and find prime factorisations with factor trees.
In Discover you met factors, multiples, primes and composites through laddoos, tiles and a sieve. This layer makes those ideas precise and gives you reliable methods:
- how to find every factor of a number without missing any, and know when to stop;
- how to decide whether a large number like 221 or 437 is prime, with the least possible work;
- the divisibility rules for 2, 3, 4, 5, 6, 8, 9, 10 and 11;
- exactly what twin primes and co-prime numbers are, with their tricky cases;
- how to break any composite number into primes with a factor tree.
Along the way you will meet the mix-ups that catch most learners, so you can avoid them.
Chapter 01
The exact language of factors
Mathematicians use several phrases for the same fact. If 3 × 5 = 15, then all of these are true:
- 3 is a factor of 15 (also: 3 is a divisor of 15).
- 15 is a multiple of 3.
- 15 is divisible by 3 (15 ÷ 3 = 5 with remainder 0).
- 3 divides 15. (Older books and later maths write this as 3 | 15, read "3 divides 15". The vertical bar is not a division sign.)
All four sentences are about whole numbers and exact division. We say 2 is not a factor of 15, even though 15 ÷ 2 = 7.5, because 7.5 is not a whole number: sharing 15 into 2 equal whole groups leaves 1 over.
- Factor / divisor
- a × b = na and b are factors of n. They divide n exactly.
- Multiple
- n = a × kn is a multiple of a when k is a counting number.
- Divisible
- remainder 0n is divisible by a when n ÷ a leaves no remainder.
- Factor pair
- (a, b)Two factors whose product is n, e.g. (4, 9) for 36.
- Proper factor
- less than nAny factor except the number itself. Proper factors of 12: 1, 2, 3, 4, 6.
Try it
Chapter 02
Finding every factor, and knowing when to stop
The safest way to list all factors is the factor-pair method:
- Write 1 and the number itself as the first pair.
- Try 2, 3, 4, 5, … in order. Whenever one divides exactly, write it with its partner (the answer of the division).
- Stop when the number you are trying is bigger than its partner would be, in other words, when the pairs meet in the middle.
The stopping rule is what makes this method fast. For 100 you only need to try up to 10, because 10 × 10 = 100. Any factor bigger than 10 must pair with a factor smaller than 10, and you have already found all of those.
Worked example
0 / 8 steps shownAll the factors of 48
List every factor of 48 using factor pairs.
Worked example
0 / 5 steps shownA square number has a lonely factor
List every factor of 36.
| Number | Factor pairs | Number of factors |
|---|---|---|
| 12 | 1 × 12, 2 × 6, 3 × 4 | 6 |
| 24 | 1 × 24, 2 × 12, 3 × 8, 4 × 6 | 8 |
| 36 | 1 × 36, 2 × 18, 3 × 12, 4 × 9, 6 × 6 | 9 |
| 48 | 1 × 48, 2 × 24, 3 × 16, 4 × 12, 6 × 8 | 10 |
| 60 | 1 × 60, 2 × 30, 3 × 20, 4 × 15, 5 × 12, 6 × 10 | 12 |
| 72 | 1 × 72, 2 × 36, 3 × 24, 4 × 18, 6 × 12, 8 × 9 | 12 |
| 84 | 1 × 84, 2 × 42, 3 × 28, 4 × 21, 6 × 14, 7 × 12 | 12 |
| 90 | 1 × 90, 2 × 45, 3 × 30, 5 × 18, 6 × 15, 9 × 10 | 12 |
| 96 | 1 × 96, 2 × 48, 3 × 32, 4 × 24, 6 × 16, 8 × 12 | 12 |
Try it
Chapter 03
Multiples, common factors and common multiples
When two numbers are in play, we often want what they share.
- A common factor of 12 and 18 divides both. Factors of 12: 1, 2, 3, 4, 6, 12. Factors of 18: 1, 2, 3, 6, 9, 18. Common factors: 1, 2, 3, 6. The largest, 6, is the highest common factor (HCF).
- A common multiple of 4 and 6 is in both times tables. Multiples of 4: 4, 8, 12, 16, 20, 24, … Multiples of 6: 6, 12, 18, 24, 30, … Common multiples: 12, 24, 36, … The smallest, 12, is the lowest common multiple (LCM).
Two numbers always have a finite list of common factors (1 is always on it) and an endless list of common multiples (their product is always on it). The HCF and LCM get their own topic; here they matter because they explain co-prime numbers, later in this layer.
Worked example
0 / 4 steps shownPacking for a school trip
A teacher has 24 bananas and 36 oranges. She wants to make identical fruit bags using all the fruit, with no fruit left over. What numbers of bags are possible, and what is the most?
Helps you understand
HCF and LCMCommon factors and common multiples lead straight to the HCF and LCM, which have their own topic.
Chapter 04
Prime, composite or neither: the precise rules
Now the three definitions can be stated exactly, for every counting number n:
- n is prime if it has exactly two factors, 1 and n. That forces n to be bigger than 1.
- n is composite if it has more than two factors. Equivalently, n can be written as a × b where both a and b are whole numbers bigger than 1.
- n = 1 has exactly one factor and is neither.
A useful way to say the composite rule: a composite number has a factor that is neither 1 nor itself. Find one such factor and you have proved the number is composite. To prove a number is prime, you must show that no such factor exists, which is harder. The rest of this layer is about doing that efficiently.
- Neither
- 1Exactly one factor. Not prime, not composite.
- Prime
- 2 factors2, 3, 5, 7, 11, 13, … The smallest is 2, the only even one.
- Composite
- 3 or more4, 6, 8, 9, 10, 12, … The smallest is 4.
- Every n ≥ 2
- one or otherEvery counting number from 2 upwards is either prime or composite, never both.
Try it
Chapter 05
The Sieve of Eratosthenes to 100
To find every prime up to 100, write the numbers 1 to 100, cross out 1, then for each prime in turn cross out its multiples. The surprise is how early you can stop: after 7.
Here is why. Every composite number up to 100 is a × b with a ≤ b. If both a and b were bigger than 10, then a × b would be bigger than 10 × 10 = 100. So every composite up to 100 has a factor that is 10 or less, and therefore a prime factor of 10 or less: 2, 3, 5 or 7. The sieve with 2, 3, 5 and 7 catches all of them.
The same reasoning tells you where to start crossing out for each prime. For 7, start at 7 × 7 = 49: the smaller multiples 14, 21, 28, 35 and 42 have a smaller prime factor (2, 3 or 5) and are already crossed out.
What remains are the 25 primes up to 100: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.
| Prime | Start at | New numbers crossed out | How many new |
|---|---|---|---|
| 2 | 4 | 4, 6, 8, … 100 (all even numbers after 2) | 49 |
| 3 | 9 | 9, 15, 21, 27, 33, 39, 45, 51, 57, 63, 69, 75, 81, 87, 93, 99 | 16 |
| 5 | 25 | 25, 35, 55, 65, 85, 95 | 6 |
| 7 | 49 | 49, 77, 91 | 3 |
Lab
Sieve 1 to 100, count how many new numbers each prime removes, then hunt for primes on the finished grid.
Start by crossing out 1. It has only one factor (itself), so it is not prime.
Legend: circled green with bold number = prime · faded with a slash = crossed out (not prime). We only need to sieve with primes up to √100 ≈ 10.0, because any composite number up to 100 has a factor no bigger than that.
Text version of this activity
The lab shows the numbers 1 to 100 in rows of 10. In sieve mode you choose each prime in turn and its multiples are crossed out, with a counter for how many new numbers each prime removed.
- 1 is crossed out first (neither prime nor composite).
- 2 removes 49 numbers (4, 6, … 100).
- 3 removes 16 more, starting at 9.
- 5 removes 6 more: 25, 35, 55, 65, 85, 95.
- 7 removes only 3 more: 49, 77, 91.
- 11 removes nothing new, because 11 × 11 = 121 is past 100.
That leaves 100 − 1 − 49 − 16 − 6 − 3 = 25 primes. In hunt mode you race to tap all the primes in a row. Useful patterns: after the first row, primes only appear in the columns ending in 1, 3, 7 and 9.
| Block | Primes | Count |
|---|---|---|
| 1–10 | 2, 3, 5, 7 | 4 |
| 11–20 | 11, 13, 17, 19 | 4 |
| 21–30 | 23, 29 | 2 |
| 31–40 | 31, 37 | 2 |
| 41–50 | 41, 43, 47 | 3 |
| 51–60 | 53, 59 | 2 |
| 61–70 | 61, 67 | 2 |
| 71–80 | 71, 73, 79 | 3 |
| 81–90 | 83, 89 | 2 |
| 91–100 | 97 | 1 |
Try it
Chapter 06
Is it prime? Trial division up to the square root
To test a single number n for being prime, you do not need to sieve. Use trial division:
- Divide n by the primes 2, 3, 5, 7, 11, 13, … in order.
- If one of them divides exactly, n is composite. Stop.
- Stop trying once the prime squared is bigger than n. If nothing has divided n by then, n is prime.
The stopping rule is the sieve's reason again. If n = a × b with a ≤ b, then a × a ≤ a × b = n, so the smaller factor a is at most √n (the square root of n, the number that multiplied by itself gives n). If no prime up to √n divides n, then n has no factor pair at all except 1 × n.
You never need to try composite numbers like 4, 6 or 9. If 9 divided n, then 3 would too, and you would already have found it.
| If the number is below… | Try these primes | Because |
|---|---|---|
| 9 | 2 | 3 × 3 = 9 |
| 25 | 2, 3 | 5 × 5 = 25 |
| 49 | 2, 3, 5 | 7 × 7 = 49 |
| 121 | 2, 3, 5, 7 | 11 × 11 = 121 |
| 169 | 2, 3, 5, 7, 11 | 13 × 13 = 169 |
| 289 | 2, 3, 5, 7, 11, 13 | 17 × 17 = 289 |
| 361 | primes up to 17 | 19 × 19 = 361 |
| 529 | primes up to 19 | 23 × 23 = 529 |
Worked example
0 / 6 steps shownIs 91 prime?
Decide whether 91 is prime.
Worked example
0 / 6 steps shownIs 211 prime?
Decide whether 211 is prime.
Predict first
Try it
Chapter 07
Divisibility rules: shortcuts for small factors
Trial division is faster with divisibility rules: quick tests that tell you whether a small number divides a big one, often just by looking at its digits. In this layer you learn how to use them. The Deepen layer shows why each one works, using place value.
| Divisible by | Test | Example that passes | Example that fails |
|---|---|---|---|
| 2 | Last digit is 0, 2, 4, 6 or 8 | 3,456 | 3,457 |
| 3 | Sum of digits is divisible by 3 | 5,142 (5 + 1 + 4 + 2 = 12) | 5,143 (sum 13) |
| 4 | Last two digits form a number divisible by 4 | 7,316 (16 = 4 × 4) | 7,318 (18) |
| 5 | Last digit is 0 or 5 | 9,875 | 9,871 |
| 6 | Divisible by 2 and by 3 | 4,524 (even; sum 15) | 4,526 (sum 17) |
| 8 | Last three digits form a number divisible by 8 | 15,128 (128 = 8 × 16) | 15,132 (132) |
| 9 | Sum of digits is divisible by 9 | 6,354 (sum 18) | 6,355 (sum 19) |
| 10 | Last digit is 0 | 4,730 | 4,735 |
| 11 | Alternating sum of digits (from the right, +, −, +, …) is 0 or a multiple of 11 | 9,284 (4 − 8 + 2 − 9 = −11) | 9,285 (−10) |
Worked example
0 / 8 steps shownTesting 7,128 with every rule
Which of 2, 3, 4, 5, 6, 8, 9, 10 and 11 divide 7,128?
Lab
Apply the digit-sum tests for 3 and 9 to sort numbers into three groups.
Use the digit-sum rule: is each number divisible by 9, divisible by 3 but not 9, or not divisible by 3?
12 cards, 3 bins. Tap a card, then tap its bin. You can also drag, or press a bin’s number key.
Text version of this activity
This game gives 12 numbers and three bins: Divisible by 9, By 3 but not by 9, and Not divisible by 3. Add the digits of each number and check the sum.
- Divisible by 9: 144 (sum 9), 1,116 (sum 9), 3,591 (sum 18), 8,181 (sum 18).
- By 3 but not 9: 231 (sum 6), 2,022 (sum 6), 6,789 (sum 30), 12,345 (sum 15).
- Not divisible by 3: 407 (sum 11), 4,444 (sum 16), 5,000 (sum 5), 10,010 (sum 2).
Every multiple of 9 is also a multiple of 3, so a number whose digit sum is 9, 18 or 27 goes in the "divisible by 9" bin. A digit sum like 30 is a multiple of 3 but not of 9.
Try it
Chapter 08
Twin primes and the only prime triplet
Twin primes are two primes whose difference is exactly 2. Up to 100 there are 8 pairs:
(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73).
Some facts to be precise about:
- (2, 3) is not a twin pair: they differ by 1. It is the only pair of primes that are next-door neighbours.
- 5 belongs to two pairs, (3, 5) and (5, 7). That makes 3, 5, 7 the only set of three primes each 2 apart, called a prime triplet in this sense. The Investigate layer finds out why there can never be another one.
- The number between a twin pair (4, 6, 12, 18, 30, 42, 60, 72) is always a multiple of 6 after the first pair. Check it for yourself.
- Up to 1,000 there are 35 twin pairs. Nobody knows whether there are infinitely many: this is the twin prime conjecture, still unsolved.
Try it
Chapter 09
Co-prime numbers
Two numbers are co-prime (also called relatively prime) when their highest common factor is 1: they share no factor except 1.
Precise facts, each worth remembering:
- Co-prime is a property of a pair (or a set) of numbers, never of one number.
- The numbers need not be prime: 8 and 15 are co-prime, and so are 4 and 9, 14 and 25, 16 and 27.
- Two different primes are always co-prime, since each has only itself and 1 as factors.
- Consecutive numbers, like 20 and 21 or 99 and 100, are always co-prime. (A number that divided both would have to divide their difference, 1.)
- Two even numbers are never co-prime: they share the factor 2.
- 1 is co-prime to every number.
- A prime p and any number that is not a multiple of p are co-prime: 7 and 30 are, but 7 and 35 are not.
Worked example
0 / 5 steps shownAre 21 and 40 co-prime? Are 21 and 45?
Decide whether each pair is co-prime.
Lab
Decide whether pairs of numbers are co-prime by looking for a shared factor bigger than 1.
Co-prime or not? Decide whether each pair shares a factor bigger than 1.
12 cards, 2 bins. Tap a card, then tap its bin. You can also drag, or press a bin’s number key.
Text version of this activity
This game shows 12 pairs of numbers and two bins, Co-prime and Not co-prime.
- Co-prime (HCF 1): 8 and 15; 20 and 21 (consecutive); 1 and 50; 12 and 35; 17 and 31 (two primes); 9 and 28; 25 and 49.
- Not co-prime: 6 and 9 (share 3); 13 and 26 (share 13); 14 and 21 (share 7); 24 and 36 (share 12); 16 and 30 (share 2).
Most of the co-prime pairs contain composite numbers. What matters is only whether the pair shares a factor.
Chapter 10
Breaking numbers into primes: factor trees
Every composite number can be split into smaller factors, and those can be split again, until only primes are left. Writing a number as a product of primes is called its prime factorisation.
A factor tree is a neat way to do it. Write the number at the top. Split it into any factor pair (not 1 × itself). Keep splitting every composite branch. Stop when every leaf at the bottom is a prime. Then multiply the leaves together.
You can also use repeated division: divide by the smallest prime that works, write down the result, and repeat until you reach 1. This is sometimes called the division ladder.
We use index form to write repeated primes neatly: 2 × 2 × 2 is written 2³ (read "2 cubed" or "2 to the power 3").
Worked example
0 / 5 steps shownTwo different trees for 60
Find the prime factorisation of 60 using two different first splits.
Worked example
0 / 7 steps shownThe division ladder for 360
Find the prime factorisation of 360 by repeated division.
Lab
Build factor trees by splitting each number into factor pairs until every leaf is prime, then write the answer in index form.
Key: double green ring = prime leaf · dashed = still to do · thick amber ring = the branch you’re working on.
Choose two numbers that multiply to make 12.
Split 12 into a factor pair:
Wrong tries on this tree: 0
Text version of this activity
This lab gives you a number at the top of a tree. You choose a factor pair to split it, then keep splitting any branch that is not prime. The lab rings each prime leaf and, at the end, writes the product in index form.
The numbers and their prime factorisations:
- 12 = 2 × 2 × 3 = 2² × 3
- 18 = 2 × 3 × 3 = 2 × 3²
- 30 = 2 × 3 × 5 = 2 × 3 × 5
- 36 = 2 × 2 × 3 × 3 = 2² × 3²
- 48 = 2 × 2 × 2 × 2 × 3 = 2⁴ × 3
- 60 = 2 × 2 × 3 × 5 = 2² × 3 × 5
- 72 = 2 × 2 × 2 × 3 × 3 = 2³ × 3²
- 84 = 2 × 2 × 3 × 7 = 2² × 3 × 7
- 90 = 2 × 3 × 3 × 5 = 2 × 3² × 5
- 100 = 2 × 2 × 5 × 5 = 2² × 5²
Try starting 36 with 4 × 9 and again with 6 × 6 or 2 × 18: the leaves always come out as two 2s and two 3s.
Lab
Connect each number to its prime factorisation written in index form.
Match each number with its prime factorisation.
8 pairs are hiding in two mixed-up columns. Pick one from each side to join them.
Text version of this activity
This connect game has 8 numbers on one side and 8 factorisations on the other. Draw a line between each matching pair.
- 24 → 2³ × 3
- 28 → 2² × 7
- 45 → 3² × 5
- 50 → 2 × 5²
- 63 → 3² × 7
- 64 → 2⁶
- 75 → 3 × 5²
- 98 → 2 × 7²
A quick check is to multiply the primes back together: for 98, 2 × 7² = 2 × 49 = 98. Watch out for 64, which is 2 multiplied by itself six times: 2⁶.
Try it
Chapter 11
Common mix-ups and how to avoid them
Words to know
All maths vocabulary →Vocabulary: precise terms
- divisor
- Another word for factor: a number that divides another exactly.
- Example: 6 is a divisor of 42.
- divisible by
- Can be divided by a number with remainder 0.
- Example: 42 is divisible by 7.
- proper factor
- A factor of a number other than the number itself.
- Example: Proper factors of 10: 1, 2, 5.
- common factor
- A number that is a factor of two or more numbers.
- Example: 3 is a common factor of 12 and 15.
- highest common factor (HCF)
- The largest number that is a factor of all the given numbers. Also called the greatest common divisor.
- Example: HCF of 12 and 18 is 6.
- common multiple
- A number that is a multiple of two or more numbers.
- Example: 24 is a common multiple of 6 and 8.
- lowest common multiple (LCM)
- The smallest number that is a multiple of all the given numbers.
- Example: LCM of 4 and 6 is 12.
- trial division
- Testing whether a number is prime by dividing it by primes up to its square root.
- square root
- The number that, multiplied by itself, gives the original number. Written √.
- Example: √49 = 7
- divisibility rule
- A shortcut test for whether a number is divisible by a small number, using its digits.
- Example: Digit sum for 3 and 9
- digit sum
- The total of a number’s digits.
- Example: Digit sum of 2,358 is 18.
- prime factorisation
- Writing a number as a product of prime numbers.
- Example: 60 = 2 × 2 × 3 × 5
- factor tree
- A branching diagram that splits a number into factors until every branch ends in a prime.
- index form
- Writing repeated factors with a small raised number (the index or power).
- Example: 2 × 2 × 2 × 3 = 2³ × 3
- relatively prime
- Another name for co-prime: having HCF 1.
- Example: 9 and 20
- prime triplet
- Here: three primes each 2 apart. The only example is 3, 5, 7.
- twin prime conjecture
- The unproved idea that there are infinitely many twin prime pairs.
Quick check
Check your understanding
11 questions · answer what you can, then check. Getting one wrong is useful.
Reflect
This stays on this page only. It isn’t saved or sent anywhere.
Keep this
Cheat sheet
- 3 × 5 = 15 means: 3 is a factor (divisor) of 15; 15 is a multiple of 3; 15 is divisible by 3.
- Factor-pair method: try 1, 2, 3, … and stop when the pairs meet. Squares have an odd number of factors.
- Prime: exactly 2 factors. Composite: more than 2 (has a factor other than 1 and itself). 1: neither.
- 2 is the only even prime. The smallest composite is 4.
- Sieve to 100: cross out multiples of 2, 3, 5, 7, starting each at p × p. 25 primes remain.
- Trial division: try primes p while p × p ≤ n. If none divides n, it is prime.
- Rules: 2, 5, 10 → last digit; 4 → last two digits; 8 → last three; 3, 9 → digit sum; 6 → 2 and 3; 11 → alternating sum.
- Combine rules only with co-prime pieces: 12 = 3 × 4, 18 = 2 × 9, 24 = 3 × 8.
- Twin primes: differ by 2. Eight pairs up to 100. 3, 5, 7 is the only prime triplet.
- Co-prime: HCF 1. Need not be primes (8, 15). Consecutive numbers always are; two evens never are.
- Prime factorisation: factor tree or division ladder. 360 = 2³ × 3² × 5. Every tree gives the same primes.
Where this comes from
Sources
Ganita Prakash, Class 8, Chapter 5: Number Play (opens another website) — National Council of Educational Research and Training (NCERT)awaiting owner check
Supports the divisibility tests and the reasons behind them: 10, 5, 2, 4 and 8 from the last digits, 9 and 3 from the digit sum, 11 from the alternating sum, 6 from 2 and 3, and combining tests for co-prime factors; also checking divisibility from prime factorisations.
Ganita Prakash, Class 6, Chapter 5: Prime Time (opens another website) — National Council of Educational Research and Training (NCERT)awaiting owner check
Supports the syllabus scope: common multiples and common factors, prime and composite numbers, the Sieve of Eratosthenes, twin primes, co-prime numbers, prime factorisation (and its uniqueness), and the divisibility tests for 10, 5, 2, 4 and 8.
Prime and Composite Numbers (opens another website) — Math is Funawaiting owner check
Supports definitions of prime and composite numbers with examples, the equal-groups/rectangle picture of factors, and 1 being neither prime nor composite.
Divisibility Rules (opens another website) — Math is Funawaiting owner check
Supports the divisibility tests for 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 12, and the rule that a number divisible by another is divisible by each of that number's factors (6 from 2 and 3; 12 from 3 and 4).
sieve of Eratosthenes (opens another website) — Encyclopaedia Britannicaawaiting owner check
Supports the sieve procedure — list the natural numbers in order, strike out 1, then every second number after 2, every third after 3, and so on, leaving the primes — and Eratosthenes of Cyrene (c. 276–194 BCE) as its namesake.
Twin prime (opens another website) — Wikipediaawaiting owner check
Supports the list of twin primes, the twin prime conjecture being unsolved, Yitang Zhang's 2013 bound below 70 million, its reduction to 246 within a year using Maynard's and Polymath's methods, and the record twin primes with 388,342 digits.
End of Understand
What you just read
- Use the precise language of factors, multiples, divisors and divisibility.
- List every factor of a number using factor pairs and explain when to stop.
- Sieve to 100 and test a number for primality by dividing by primes up to its square root.
- Apply divisibility rules for 2, 3, 4, 5, 6, 8, 9, 10 and 11, and combine them only with co-prime pieces.
- Identify twin primes and co-prime pairs, and find prime factorisations with factor trees.
- Next depthGo deeper: InvestigateChange conditions, predict, compare evidence and test.
- Practise79 questionsHints and a worked solution for every question — or play a 10-question round.
- Step backDiscoverGo back over the ground before this one — you can move up and down as often as you like.
- TopicAll of prime and composite numbersThe whole ladder, the connections and the words to know, on one page.
The web
Explore a connection
Builds on
Four operationsTesting whether a number is prime is just careful division: does anything divide it exactly?
Helps you understand
HCF and LCMPrime factorisation is the fastest route to both the HCF and the LCM.
Contrasts with
Number and shape patternsPrimes famously refuse to follow a simple pattern, unlike even numbers, squares or multiples.
Want to save topics or ask for new ones? Invited families can connect a learning device. Everything here stays free to read without signing in.
Revision 1 · release preview-7e1cbbcc4f · accepted 20/09/2026