Fermat's little theorem and congruence equations

Fermat's little theorem and congruence equations Quiz

Spec 5.4 · Edexcel A-Level Further Maths: Quiz

Studying this course? Keep your progress in one place.

Pick an answer for each. Quizzes never use energy.

5 questions, one answer each

Each answer is checked as you go, with why.

See all 5 questions
  1. 1. By Fermat's little theorem, 210≡2^{10}\equiv what, modulo 1111?

    • A. 11
    • B. 22
    • C. 1010
    • D. 00
  2. 2. What is 3503^{50} modulo 77?

    • A. 11
    • B. 33
    • C. 22
    • D. 44
  3. 3. What is the multiplicative inverse of 55 modulo 77?

    • A. 22
    • B. 33
    • C. 44
    • D. 55
  4. 4. Which congruence has no solutions?

    • A. 4x≡2(mod6)4x\equiv2\pmod6
    • B. 9x≡6(mod12)9x\equiv6\pmod{12}
    • C. 5x≡1(mod8)5x\equiv1\pmod8
    • D. 8x≡5(mod12)8x\equiv5\pmod{12}
  5. 5. How many solutions modulo 1212 does 8x≡4(mod12)8x\equiv4\pmod{12} have?

    • A. 44
    • B. 11
    • C. 22
    • D. 88

Quiz