plumiEuclid's algorithm and Bezout: Edexcel A‑Level Further Maths questions
Edexcel A-Level Further Maths past-paper questions on 7.5 Euclid's algorithm and Bezout, 2018–2025, with mark schemes and examiner’s reports where available. Add MadAsMaths questions to your practice, or browse them separately by topic and difficulty.
Questions from
Paper
All papers
Exam
All years
Loading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDFLoading the question…
Open the full PDF
All 9 questions on Euclid's algorithm and Bezout, as a list
- June 2025, Further Pure 2, Q7 (6 marks): (i) Explain why the congruence equation 21x ≡ 11(mod 36) has no solutions. (2) (ii) Use modular arithmetic to solve the congruence equation 36y ≡ 192(mod 40) (4
- June 2025, AS Further Pure 2, Q1 (8 marks): 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 algor
- June 2024, Further Pure 2, Q3 (11 marks): 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 det
- June 2023, Further Pure 2, Q4 (9 marks): (a) Use the Euclidean algorithm to show that the highest common factor of 168 and 66 is 6 (2) (b) Use back substitution to determine integers a and b such that
- June 2022, Further Pure 2, Q4 (7 marks): (a) Use the Euclidean algorithm to show that 124 and 17 are relatively prime (coprime). (2) (b) Hence solve the equation 124x + 17y = 10 (3) (c) Solve the congr
- June 2022, AS Further Pure 2, Q4 (11 marks): 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
- November 2021, Further Pure 2, Q3 (8 marks): (a) Use the Euclidean Algorithm to find integers a and b such that 125a + 87b = 1 (5) (b) Hence write down a multiplicative inverse of 87 modulo 125 (1) (c) Sol
- November 2020, AS Further Pure 2, Q2 (6 marks): The highest common factor of 963 and 657 is c. (a) Use the Euclidean algorithm to find the value of c. (3) (b) Hence find integers a and b such that 963a + 657b
- June 2018, AS Further Pure 2, Q1 (5 marks): (i) Using a suitable algorithm and without performing any division, determine whether 23 738 is divisible by 11 (2) (ii) Use the Euclidean algorithm to find the
Questions, mark schemes and examiner’s reports are © Pearson Edexcel, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Edexcel A-Level Further Maths past papers.
The Plumi iPad app also offers exam-style questions with AI feedback on your handwritten working.