← All lessons

Modular Arithmetic (Hard)

Late AMC 10/12 through early AIME — dense computation.

Modular Arithmetic: core idea

CRT systems.

Example problem: hint and answer

Find 3100 mod 173^{100}\bmod 17.

Hint: Fermat / order. Answer: 1.

Practice (9 problems — type your answers)

  • 1. Smallest positive nn with n≡3(mod8)n\equiv 3\pmod8, n≡4(mod9)n\equiv 4\pmod9, n≡5(mod7)n\equiv 5\pmod7.

  • 2. Last two digits of 720247^{2024}.

  • 3. φ(720)\varphi(720).

  • 4. Number of solutions to x2≡1(mod100)x^2\equiv1\pmod{100}.

  • 5. Least composite n>1n>1 with 2n≡2(modn)2^n\equiv2\pmod n?

  • 6. 7100 mod 137^{100}\bmod 13.

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

  • 8. Order of 1010 modulo 2121.

  • 9. Inverse of 1111 modulo 2626.

Modular Arithmetic Practice Problems — Hard