2019 AIME I Problem 14

Attempt Problem 14 of the 2019 AIME I below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2019 AIME I solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

14.

Find the least odd prime factor of 20198+1.2019^8 + 1.

Answer: 97
Concepts:multiplicative ordermodular exponentiation
Difficulty rating: 2990
Small Hint:

If pp divides 20198+1,2019^8 + 1, then 20198≡−1(modp),2019^8 \equiv -1 \pmod{p}, so the order of 20192019 modulo pp is exactly 1616

Big Hint:

The order divides p−1,p - 1, so p≡1(mod16);p \equiv 1 \pmod{16}; test the smallest such primes by repeated squaring of 2019 mod p2019 \bmod p

Solution:

Suppose an odd prime pp divides 20198+1.2019^8 + 1. Then 20198≡−1(modp),2019^8 \equiv -1 \pmod{p}, so 201916≡12019^{16} \equiv 1 while 20198≢1:2019^8 \not\equiv 1: the multiplicative order of 20192019 modulo pp is exactly 16.16. Since the order divides p−1,p - 1, we need p≡1(mod16),p \equiv 1 \pmod{16}, and the smallest such primes are 1717 and 97.97.

Modulo 17:17: 2019≡13,2019 \equiv 13, and 132=169≡−1,13^2 = 169 \equiv -1, so 20198≡(−1)4=12019^8 \equiv (-1)^4 = 1 and 20198+1≡2≠0.2019^8 + 1 \equiv 2 \neq 0. Modulo 97:97: 2019≡−18,2019 \equiv -18, and squaring repeatedly, 20192≡324≡33,20194≡332=1089≡22,20198≡222=484≡−1(mod97). \begin{aligned} 2019^2 &\equiv 324 \equiv 33, \\ 2019^4 &\equiv 33^2 = 1089 \\ &\equiv 22, \\ 2019^8 &\equiv 22^2 = 484 \\ &\equiv -1 \pmod{97}. \end{aligned}

So 9797 divides 20198+1,2019^8 + 1, and it is the least odd prime factor: 97.97.

Problem 13#13
Full Exam

Problem 14 in Other Years