Skip to content
Android waitlistTry on iPad
Get started

Fermat's little theorem: Edexcel A‑Level Further Maths questions

Edexcel A-Level Further Maths past-paper questions on 7.6 Fermat's little theorem, 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

789 questions

  1. Q5

    June 2025 · Further Pure 2

    The whole paper ↗

    Loading the question…

    Open the full PDF
  2. Q1

    June 2024 · Further Pure 2

    The whole paper ↗

    Loading the question…

    Open the full PDF
  3. Q4

    November 2021 · Further Pure 2

    The whole paper ↗

    Loading the question…

    Open the full PDF
  4. Q4

    June 2019 · Further Pure 2

    The whole paper ↗

    Loading the question…

    Open the full PDF
All 4 questions on Fermat's little theorem, as a list
  1. June 2025, Further Pure 2, Q5 (10 marks): (i) A password is to be created from 5 characters using the following criteria • one capital letter • 3 distinct single digits • one of the four symbols @ £ $ &
  2. June 2024, Further Pure 2, Q1 (4 marks): In this question you must show detailed reasoning. Use Fermat’s Little Theorem to determine the least positive residue of 21 80 (mod 23) (4)
  3. November 2021, Further Pure 2, Q4 (7 marks): Let G be a group of order 46 46 + 47 47 Using Fermat’s Little Theorem and explaining your reasoning, determine which of the following are possible orders for a
  4. June 2019, Further Pure 2, Q4 (12 marks): (i) Use Fermat’s Little Theorem to find the least positive residue of 6PRGXOR (5) (ii) Seven students, Alan, Brenda, Charles, Devindra, Enid, Felix and G

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.