: Edexcel past-paper questions pack
Back to the topic page

Number theory: Euclid, Bezout, modular arithmetic and Fermat

Past-paper questions pack

Name
Class
Date set
Date due
Score/ 142

Questions are numbered; the mark schemes (the answer key) follow on separate pages so the question pages can be handed out alone. www.alevelfurthermathstutor.com

Edexcel AS and A-level Further Maths past-paper questions since June 2018 · 48 parts, 142 marks · mark schemes follow the questions · www.alevelfurthermathstutor.com · Questions and mark schemes © Pearson Education Ltd

1. June 2025 · AS Paper 2 (Further Pure 2) · Q1(i)(a) · 3 marks
1. In this question you must show all stages of your working. Solutions based entirely on calculator technology are not acceptable. (i) (a) Use the Euclidean algorithm to determine the highest common factor h of 105 and 24 (3)
2. June 2025 · AS Paper 2 (Further Pure 2) · Q1(i)(b) · 3 marks
(b) Hence determine integers a and b such that 105a + 24b = h (3)
3. June 2025 · AS Paper 2 (Further Pure 2) · Q1(ii) · 2 marks
5 is divided by 11 (ii) Determine the remainder when 179 (2)
4. June 2025 · AS Paper 2 (Further Pure 2) · Q2(i) · 2 marks
2. (i) Using a suitable algorithm and without performing any division, determine whether 13 306 617 is divisible by 9 (2)
5. June 2025 · Paper 4A (Further Pure 2) · Q5(ii) · 3 marks
50 modulo 13 (ii) Use Fermat’s Little Theorem to determine the least positive residue of 4 (3)
6. June 2025 · Paper 4A (Further Pure 2) · Q7(i) · 2 marks
7. (i) Explain why the congruence equation 21x ≡ 11(mod 36) has no solutions. (2)
7. June 2025 · Paper 4A (Further Pure 2) · Q7(ii) · 4 marks
(ii) Use modular arithmetic to solve the congruence equation 36y ≡ 192(mod 40) (4)
8. June 2024 · AS Paper 2 (Further Pure 2) · Q2(a) · 1 marks
2. Tiles are sold in boxes with 21 tiles in each box. The tiles are laid out in x rows of 5 tiles and y rows of 6 tiles. All the tiles from a box are used before the next box is opened. When all the rows of tiles have been laid, there are n tiles left in the last opened box. (a) Write down a congruence expression for n in the form ax + by(mod c) where a, b and c are integers. (1)
9. June 2024 · AS Paper 2 (Further Pure 2) · Q2(b) · 5 marks
Given that • exactly 43 rows of tiles are laid • there are no tiles left in the last opened box (b) use your congruence expression to determine the minimum number of rows of 6 tiles laid. (5)
10. June 2024 · Paper 4A (Further Pure 2) · Q1 · 4 marks
1. In this question you must show detailed reasoning. Use Fermat’s Little Theorem to determine the least positive residue of 80 (mod 23) (4)
11. June 2024 · Paper 4A (Further Pure 2) · Q3(a) · 3 marks
3. In this question you must show all stages of your working. Solutions relying on calculator technology are not acceptable. (a) Use the Euclidean Algorithm to determine the highest common factor h of 234 and 96 (3)
12. June 2024 · Paper 4A (Further Pure 2) · Q3(b) · 3 marks
(b) Hence determine integers a and b such that 234a + 96b = h (3)
13. June 2024 · Paper 4A (Further Pure 2) · Q3(c) · 5 marks
(c) Solve the congruence equation 96x ≡ 36 (mod 234) (5)
14. June 2023 · AS Paper 2 (Further Pure 2) · Q5(i) · 3 marks
5. (i) Making your reasoning clear and using modulo arithmetic, show that 6 is divisible by 8 (3)
15. June 2023 · AS Paper 2 (Further Pure 2) · Q5(ii)(a) · 2 marks
(ii) The following 7‑digit number has four unknown digits a 5 b 8 a b 0 Given that the number is divisible by 11 (a) determine the value of the digit a. (2)
16. June 2023 · AS Paper 2 (Further Pure 2) · Q5(ii)(b) · 3 marks
Given that the number is also divisible by 3 (b) determine the possible values of the digit b. (3)
17. June 2023 · Paper 4A (Further Pure 2) · Q4(a) · 2 marks
4. (a) Use the Euclidean algorithm to show that the highest common factor of 168 and 66 is 6 (2)
18. June 2023 · Paper 4A (Further Pure 2) · Q4(b) · 3 marks
(b) Use back substitution to determine integers a and b such that a b (3)
19. June 2023 · Paper 4A (Further Pure 2) · Q4(c) · 1 marks
(c) Explain why there are no integer solutions to the equation x y (1)
20. June 2023 · Paper 4A (Further Pure 2) · Q4(d) · 3 marks
(d) Solve the congruence equation v ≡ (mod ) (3)
21. June 2023 · Paper 4A (Further Pure 2) · Q5(ii) · 4 marks
(ii) A combination lock code consists of four distinct digits that can be read as a positive integer, N = abcd, satisfying • all the digits are odd • N is divisible by 9 • the digits appear in either ascending or descending order • N ≡ e (mod ab ) where ab is read as a two-digit number and e is the odd digit that is not used in the code (a) Use the first two properties to determine the four digits used in the code. (b) Hence determine the code on the lock. (4)
22. June 2022 · AS Paper 2 (Further Pure 2) · Q3(i) · 3 marks
3. (i) Let G be a group of order 5 291 848 Without performing any division, use proof by contradiction to show that G cannot have a subgroup of order 11 (3)
23. June 2022 · AS Paper 2 (Further Pure 2) · Q4(i)(a) · 3 marks
4. In this question you must show all stages of your working. Solutions relying on calculator technology are not acceptable. (i) (a) Use the Euclidean algorithm to find the highest common factor h of 416 and 72 (3)
24. June 2022 · AS Paper 2 (Further Pure 2) · Q4(i)(b) · 3 marks
(b) Hence determine integers a and b such that 416a + 72b = h (3)
25. June 2022 · AS Paper 2 (Further Pure 2) · Q4(i)(c) · 2 marks
(c) Determine the value c in the set {0,1,2...,415} such that 23 x 72 º c (mod 416) (2)
26. June 2022 · AS Paper 2 (Further Pure 2) · Q4(ii) · 3 marks
(ii) Evaluate 510 (mod 13) giving your answer as the smallest positive integer solution. (3)
27. June 2022 · Paper 4A (Further Pure 2) · Q4(a) · 2 marks
4. (a) Use the Euclidean algorithm to show that 124 and 17 are relatively prime (coprime). (2)
28. June 2022 · Paper 4A (Further Pure 2) · Q4(b) · 3 marks
(b) Hence solve the equation 124x + 17y = 10 (3)
29. June 2022 · Paper 4A (Further Pure 2) · Q4(c) · 2 marks
(c) Solve the congruence equation 124x ≡ 6 mod 17 (2)
30. June 2022 · Paper 4A (Further Pure 2) · Q7(ii)(a) · 2 marks
(ii) A 3-digit positive integer N = abc has the following properties • N is divisible by 11 • the sum of the digits of N is even • N ≡ 8 mod 9 (a) Use the first two properties to show that a – b + c = 0 (2)
31. June 2022 · Paper 4A (Further Pure 2) · Q7(ii)(b) · 4 marks
(b) Hence determine all possible integers N, showing all your working and reasoning. (4)
32. Nov 2021 · Paper 4A (Further Pure 2) · Q1 · 4 marks
1. In this question you must show detailed reasoning. Without performing any division, explain why n = 20 210 520 is divisible by 66 (4)
33. Nov 2021 · Paper 4A (Further Pure 2) · Q3(a) · 5 marks
3. (a) Use the Euclidean Algorithm to find integers a and b such that 125a + 87b = 1 (5)
34. Nov 2021 · Paper 4A (Further Pure 2) · Q3(b) · 1 marks
(b) Hence write down a multiplicative inverse of 87 modulo 125 (1)
35. Nov 2021 · Paper 4A (Further Pure 2) · Q3(c) · 2 marks
(c) Solve the linear congruence 87x ≡ 16 (mod 125) (2)
36. Nov 2021 · Paper 4A (Further Pure 2) · Q4 · 7 marks
4. Let G be a group of order 46 46 + 47 Using Fermat’s Little Theorem and explaining your reasoning, determine which of the following are possible orders for a subgroup of G (i) 11 (ii) 21 (7)
37. Oct 2020 · AS Paper 2 (Further Pure 2) · Q2(a) · 3 marks
2. The highest common factor of 963 and 657 is c. (a) Use the Euclidean algorithm to find the value of c. (3)
38. Oct 2020 · AS Paper 2 (Further Pure 2) · Q2(b) · 3 marks
(b) Hence find integers a and b such that 963a + 657b = c (3)
39. Oct 2020 · Paper 4A (Further Pure 2) · Q8(a) · 2 marks
8. The four digit number n = abcd satisfies the following properties: (1) n ≡ 3 (mod 7) (2) n is divisible by 9 (3) the first two digits have the same sum as the last two digits (4) the digit b is smaller than any other digit (5) the digit c is even (a) Use property (1) to explain why 6a + 2b + 3c + d ≡ 3 (mod 7) (2)
40. Oct 2020 · Paper 4A (Further Pure 2) · Q8(b) · 4 marks
(b) Use properties (2), (3) and (4) to show that a + b = 9 (4)
41. Oct 2020 · Paper 4A (Further Pure 2) · Q8(c) · 2 marks
(c) Deduce that c ≡ 5(a – 1) (mod 7) (2)
42. Oct 2020 · Paper 4A (Further Pure 2) · Q8(d) · 4 marks
(d) Hence determine the number n, verifying that it is unique. You must make your reasoning clear. (4)
43. June 2019 · AS Paper 2 (Further Pure 2) · Q2(i) · 2 marks
2. (i) Determine all the possible integers a, where a ! 3, such that { mod a (2)
44. June 2019 · AS Paper 2 (Further Pure 2) · Q2(ii) · 3 marks
{ mod then either (ii) Show that if p is prime, x is an integer and x p { 1mod or x x p ≡-1mod p (3)
45. June 2019 · AS Paper 2 (Further Pure 2) · Q2(iii) · 2 marks
(iii) A company has £13 940 220 to share between 11 charities. Without performing any division and showing all your working, decide if it is possible to share this money equally between the 11 charities. (2)
46. June 2019 · Paper 4A (Further Pure 2) · Q4(i) · 5 marks
4. (i) Use Fermat’s Little Theorem to find the least positive residue of 6542 modulo 13 (5)
47. June 2018 · AS Paper 2 (Further Pure 2) · Q1(i) · 2 marks
1. (i) Using a suitable algorithm and without performing any division, determine whether 23 738 is divisible by 11 (2)
48. June 2018 · AS Paper 2 (Further Pure 2) · Q1(ii) · 3 marks
(ii) Use the Euclidean algorithm to find the highest common factor of 2322 and 654 (3)

Mark schemes

Each mark scheme shows the whole question; the parts on this topic are the ones listed above.

June 2025 · AS Paper 2 (Further Pure 2) · Q1
Mark scheme June 2025 Paper 2 (Further Pure 2) Q1(ii)
June 2025 · AS Paper 2 (Further Pure 2) · Q2
Mark scheme June 2025 Paper 2 (Further Pure 2) Q2(i)
June 2025 · Paper 4A (Further Pure 2) · Q5
Mark scheme June 2025 Paper 4A (Further Pure 2) Q5(ii)
June 2025 · Paper 4A (Further Pure 2) · Q7
Mark scheme June 2025 Paper 4A (Further Pure 2) Q7(ii)
June 2024 · AS Paper 2 (Further Pure 2) · Q2
Mark scheme June 2024 Paper 2 (Further Pure 2) Q2(b)
June 2024 · Paper 4A (Further Pure 2) · Q1
Mark scheme June 2024 Paper 4A (Further Pure 2) Q1
June 2024 · Paper 4A (Further Pure 2) · Q3
Mark scheme June 2024 Paper 4A (Further Pure 2) Q3(c)
June 2023 · AS Paper 2 (Further Pure 2) · Q5
Mark scheme June 2023 Paper 2 (Further Pure 2) Q5(ii)(b)
June 2023 · Paper 4A (Further Pure 2) · Q4
Mark scheme June 2023 Paper 4A (Further Pure 2) Q4(d)
June 2023 · Paper 4A (Further Pure 2) · Q5
Mark scheme June 2023 Paper 4A (Further Pure 2) Q5(ii)
June 2022 · AS Paper 2 (Further Pure 2) · Q3
Mark scheme June 2022 Paper 2 (Further Pure 2) Q3(i)
June 2022 · AS Paper 2 (Further Pure 2) · Q4
Mark scheme June 2022 Paper 2 (Further Pure 2) Q4(ii)
June 2022 · Paper 4A (Further Pure 2) · Q4
Mark scheme June 2022 Paper 4A (Further Pure 2) Q4(c)
June 2022 · Paper 4A (Further Pure 2) · Q7
Mark scheme June 2022 Paper 4A (Further Pure 2) Q7(ii)(b)
Nov 2021 · Paper 4A (Further Pure 2) · Q1
Mark scheme Nov 2021 Paper 4A (Further Pure 2) Q1
Nov 2021 · Paper 4A (Further Pure 2) · Q3
Mark scheme Nov 2021 Paper 4A (Further Pure 2) Q3(c)
Nov 2021 · Paper 4A (Further Pure 2) · Q4
Mark scheme Nov 2021 Paper 4A (Further Pure 2) Q4
Oct 2020 · AS Paper 2 (Further Pure 2) · Q2
Mark scheme Oct 2020 Paper 2 (Further Pure 2) Q2(b)
Oct 2020 · Paper 4A (Further Pure 2) · Q8
Mark scheme Oct 2020 Paper 4A (Further Pure 2) Q8(d)
June 2019 · AS Paper 2 (Further Pure 2) · Q2
Mark scheme June 2019 Paper 2 (Further Pure 2) Q2(iii)
June 2019 · Paper 4A (Further Pure 2) · Q4
Mark scheme June 2019 Paper 4A (Further Pure 2) Q4(i)
June 2018 · AS Paper 2 (Further Pure 2) · Q1
Mark scheme June 2018 Paper 2 (Further Pure 2) Q1(ii)