Back to homeMathematics · 1st ESO · Change subject
Start for free
ESO Y1 · Mathematics
Numbers · Divisibility

Prime numbers and prime factorisation

$13$ friends cannot line up in equal rows of more than one person: they only fit in a single row of $13$, or each on their own. In contrast, $12$ can be arranged in lots of ways: $2 \cdot 6$, $3 \cdot 4$, $1 \cdot 12$... The difference lies in their divisors.

Prime and composite numbers

Graphical comparison of rectangles: 7 only allows one row of 1 by 7, whereas 12 allows arrangements of 1 by 12, 2 by 6 and 3 by 4. 7 (prime) 1 × 7 — only one way 12 (composite) 1×12 2×6 3×4
Practice★☆☆Not started
In PE class, the teacher wants to arrange the $13$ students into perfect rows and columns for an exercise (for example, $2$ rows of $6$ people). a) Why can they not do…

In PE class, the teacher wants to arrange the $13$ students into perfect rows and columns for an exercise (for example, $2$ rows of $6$ people).

  1. a) Why can they not do this with $13$ students in any way other than a single row of $13$?
  2. b) What type of number is $13$ based on its factors?
3 4 12 = 3 × 4 1 left over! 13 = 3 × 4 + 1 1 13 13 = 1 × 13
Solve
Practice★☆☆Not started
Classify the following numbers in the table according to whether they are prime (they only have two factors: $1$ and themselves) or composite (they have more than two…

Classify the following numbers in the table according to whether they are prime (they only have two factors: $1$ and themselves) or composite (they have more than two factors):

$11, 14, 19, 21, 23, 27, 31, 33$

Prime Numbers Composite Numbers
Solve

The Sieve of Eratosthenes

More than $2.000$ years ago, Eratosthenes came up with a "filter" to find all the primes up to a given number: you cross out the multiples of each prime you find, and whatever survives is prime.

Number grid for the Sieve of Eratosthenes, used to cross out successive multiples and isolate the prime numbers. 1 2 3 4 5 6 7 8 9 10 blank: crossed out as a multiple of 2, 3 or 5 (and 1, separately) coloured: surviving primes → 2, 3, 5, 7

The sieve as an algorithm

An algorithm is a precise list of instructions. Follow this version to find the primes up to 30:

  1. Write the numbers from 2 to 30. The 1 is left out because it is not prime.

  2. Circle the smallest number that is not yet circled or crossed out.

  3. Cross out its multiples that are greater than it, without crossing out the circled number itself.

  4. Repeat steps 2 and 3 until every number is either circled or crossed out. The circled numbers are the primes.

Practice★☆☆Not started
At a card collectors' convention, the display stands are numbered from $10$ to $25$. The organisers want to highlight stands with a prime number using an orange sign.…

At a card collectors' convention, the display stands are numbered from $10$ to $25$. The organisers want to highlight stands with a prime number using an orange sign. Write the list of all stand numbers that should have an orange sign.

STAND 10 STAND 11 STAND 12 STAND 13 STAND 14 STAND 15 STAND 16 STAND 17 STAND 18 STAND 19 STAND 20 STAND 21 STAND 22 STAND 23 STAND 24 STAND 25 Orange sign (Prime Number) To check
Solve
Practice★☆☆Not started
The Sieve of Eratosthenes works like a filter that lets only prime numbers through. If we pour the numbers from $1$ to $10$ into the filter, explain why the number $1$…

The Sieve of Eratosthenes works like a filter that lets only prime numbers through. If we pour the numbers from $1$ to $10$ into the filter, explain why the number $1$ is not considered prime and why the number $9$ gets trapped in the filter for composite numbers.

Input: 1 to 10 1 Discarded Neither prime nor composite 4 6 8 10 9 Trapped Is composite 9 = 3² 7 5 3 2 Prime Numbers Pass the filter
Solve
Practice★★☆Not started
In a maths class, the teacher says that to find out if a number less than $100$ is prime, it is sufficient to check that it is not divisible by $2, 3, 5$ and $7$.…

In a maths class, the teacher says that to find out if a number less than $100$ is prime, it is sufficient to check that it is not divisible by $2, 3, 5$ and $7$.

Explain why there is no need to check if it is divisible by $11$ or by other larger prime numbers. Apply this idea to check if the number $97$ is prime.

Solve

Prime factorisation

Every composite number can be written as a product of prime numbers: it is like finding the "building blocks" it is made of.

Vertical bar layout of the prime factorisation of 120, giving two cubed times three times five. 1202 602 302 153 55 1 120 = 2³ · 3 · 5
Practice★☆☆Not started
Find the prime factorisation of the number $40$ using the vertical line method and express the result as a product of powers.

Find the prime factorisation of the number $40$ using the vertical line method and express the result as a product of powers.

Solve
Practice★★☆Not started
Find the prime factorisation of the following numbers using the vertical line method. Express the final result using powers where possible: a) $180$ b) $252$ c) $450$

Find the prime factorisation of the following numbers using the vertical line method. Express the final result using powers where possible:

  1. a) $180$
  2. b) $252$
  3. c) $450$
Solve
Practice★★☆Not started
Sometimes, to factorize numbers ending in zero, we can use mental "shortcuts". For example, we know that $10 = 2 \cdot 5$, so each trailing zero contributes a factor $2$…

Sometimes, to factorize numbers ending in zero, we can use mental "shortcuts". For example, we know that $10 = 2 \cdot 5$, so each trailing zero contributes a factor $2$ and a factor $5$.

Factorize the following numbers using this trick to save steps in the vertical line (you can remove each trailing zero at once by writing $2 \cdot 5$ on the right):

  1. a) $1.200$
  2. b) $4.500$
  3. c) $18.000$
Diagram of the shortcut: a trailing zero breaks down into the factors 2 and 5 SHORTCUT 0 2 5 Each trailing zero contributes a 2 and a 5
Solve

Divisors from the factorisation

Once you have the factorisation, you can find all the divisors by combining the factors, without having to test them one by one.

Tree diagram showing how the powers of the prime factors are combined to obtain all the divisors of a number. N = 2² · 13 1 2 4 13 26 52 powers of 2 × 1 o × 13
Practice★★☆Not started
Find all the factors of the number $N$ knowing that its prime factorisation is $N = 2^2 \cdot 13$. Is $N$ a composite or prime number? Justify your answer based on the…

Find all the factors of the number $N$ knowing that its prime factorisation is $N = 2^2 \cdot 13$. Is $N$ a composite or prime number? Justify your answer based on the definition of these types of numbers.

Solve
Practice★★☆Not started
Find all the factors of the following numbers using their prime factorisation. Show the process of combining factors: a) $28$ b) $42$

Find all the factors of the following numbers using their prime factorisation. Show the process of combining factors:

  1. a) $28$
  2. b) $42$
Solve

Back to the start: The group of $13$ friends can only form one row because $13$ is prime (its only divisors are $1$ and $13$); in contrast, $12$ is composite and has $6$ different divisors ($1, 2, 3, 4, 6$ and $12$), which allows many different arrangements.

Summary

See all the exercises in this section