What is it about?
A prime number is a natural number with exactly two divisors: and itself. are primes. is not a prime, because it has only one divisor. is the only even prime. Numbers with more than two divisors are called composite.
Prime factorisation: Every natural number greater than can be written as a product of primes. In a factor tree you keep splitting until only primes are left:
However you start the tree, you always end with the same prime factors. The prime factorisation is unique (apart from the order).
Divisibility rules help you find divisors quickly:
- by , or : look at the last digit.
- by or : look at the number formed by the last two digits.
- by or : check the digit sum, e.g. .
- by : the number is divisible by and by .
Sieve of Eratosthenes: Cross out . The smallest number not crossed out is a prime; circle it and cross out all its multiples. For a prime , the first multiple that gets newly crossed out is , e.g. for – smaller multiples are already crossed out. Up to the primes and are enough, because is already greater than .
gcd and lcm: The greatest common divisor is the product of the common prime factors. The least common multiple is the product of all prime factors, where common ones are counted only once. With and :
Try it
- Split 360 step by step: tap the dashed numbers or press Split.
- Press Another tree several times. What changes, and what always stays the same?
- Always split off the smallest prime factor. What does the tree look like now?
- Split 512 and write the result as a power.
- Tap a number in the tree: next to it (below it on a phone) you see which numbers divide it. Try 783 – the digit sum tells you a lot.
- Run the sieve up to 100 with Next prime. Tap a crossed-out number: which prime crossed it out?
- Arrange the numbers in 6 columns. In which columns are the primes from on? Why?
- Find gcd and lcm of 24 and 36 with Sort the factors. What happens with 8 and 15?
Tasks
Task 1: Prime factorisation
Load task Split , and into prime factors and write them with powers.
Task 2: Divisibility rules
Check without a calculator whether is divisible by , , , and .
Show solution
The last digit is even: divisible by . The digit sum is divisible by , but not by . is divisible by , so is too. Divisible by and by means divisible by . is only not divisible by . Check
Task 3: Finding primes
Which primes lie between and ?
Show solution
, , and . All other numbers in between are divisible by , , or , e.g. and . Show the sieve
Task 4: gcd and lcm
Load task Find the gcd and lcm of and using their prime factors.
Show solution
and . The common factors are , so . All factors: .
Task 5: Buses
Two buses leave at the same time at o’clock. Bus A leaves every minutes, bus B every minutes. When do they next leave at the same time?
Show solution
You need the least common multiple: . The buses leave together again at . Show in the simulation
Task 6: Why is 7 enough?
Explain why you can stop after the multiples of when sieving up to .
Show solution
A composite number up to is a product with . If were greater than , then . So every composite number up to has a divisor up to and therefore a prime factor , , or – it has already been crossed out.
Ideas for the classroom
- Use: About grade 5 (prime factorisation and divisibility rules). gcd and lcm are needed later for simplifying fractions and finding common denominators (year 6).
- Three views: factor tree with divisibility rules, sieve of Eratosthenes and gcd/lcm in a set diagram. Each prime keeps the same colour in all views.
- Step by step: If “Show the result right away” is off (
show=0), tree, sieve and set diagram start empty and are built up with the buttons or by tapping. - Uniqueness: “Another tree” splits with random divisors. That the same prime factors always appear is a good reason to ask why (without proof in year 5).
- Common stumbling blocks:
- “ is a prime.”
- “Odd numbers are primes.” – , , and are not.
- The digit-sum rule is applied to .
- gcd and lcm are mixed up; the set diagram shows: the intersection gives the gcd, everything together the lcm.