plumiEuclid's algorithm and Bezout: OCR MEI A‑Level Further Maths questions
OCR MEI 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 PDF
All 2 questions on Euclid's algorithm and Bezout, as a list
- June 2025, Further Pure with Technology, Q2 (21 marks): 2 (a) (i) Write down 7 ( mod 1000 ) . [1] Fermat’s little theorem states that if p is a prime and x is an integer which is co-prime to p, 1 / p then x - 1 ( mod
- November 2021, Further Pure with Technology, Q3 (20 marks): (a) (i) Create a program which returns the highest common factor of positive integers m and n. Write out your program in full in the Printed Answer Booklet. [3]
Questions, mark schemes and examiner’s reports are © OCR, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? OCR MEI A-Level Further Maths past papers.
The Plumi iPad app also offers exam-style questions with AI feedback on your handwritten working.