← All lessons

Modular Arithmetic (Medium)

AMC 10/12 mid (≈Q9–16) — multi-step.

Modular Arithmetic: core idea

Units digits / cycles.

Example problem: hint and answer

Compute 310 mod 113^{10}\bmod 11.

Hint: Fermat: 310≡1(mod11)3^{10}\equiv 1\pmod{11}. Answer: 1.

Practice (9 problems — type your answers)

  • 1. Find the smallest positive integer nn with n≡2(mod5)n\equiv 2\pmod 5 and n≡3(mod7)n\equiv 3\pmod 7.

  • 2. Compute 220 mod 132^{20}\bmod 13.

  • 3. What is the last digit of 720237^{2023}?

  • 4. Compute 5100 mod 135^{100}\bmod 13.

  • 5. Find the smallest positive nn with n≡4(mod6)n\equiv 4\pmod 6 and n≡5(mod8)n\equiv 5\pmod 8.

  • 6. Compute 615 mod 176^{15}\bmod 17.

  • 7. How many integers 1≤n≤1051\le n\le 105 are coprime to 105105?

  • 8. Find the modular inverse of 33 modulo 1111.

  • 9. Compute 1050 mod 710^{50}\bmod 7.

Modular Arithmetic Practice Problems — Medium