2026 AMC 12A Problem 25

Attempt Problem 25 of the 2026 AMC 12A 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 2026 AMC 12A solutions, or check the answer key.

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

25.

Let mm be a positive integer such that there are at least 5050 positive integers xx less than mm for which x2−1x^2 - 1 is a multiple of m.m. What is the sum of the digits of the least possible value of m?m?
1212
1515
1616
1818
2222
Answer: B
Concepts:modular arithmeticChinese Remainder Theoremprime factorization
Small hint:
Mod an odd prime power, x2≡1x^2 \equiv 1 has 22 solutions. Mod 2,2, 4,4, and 2k2^k with k≥3,k \ge 3, it has 1,1, 2,2, and 4.4.
Big hint:
By the Chinese Remainder Theorem the counts multiply, so the count must reach 6464
Solution:
We are counting the solutions of x2≡1(modm)x^2 \equiv 1 \pmod{m} among 1,2,…,m−1.1, 2, \ldots, m - 1. For m>1m \gt 1 this is every solution modulo m,m, because x=0x = 0 is never one.
Modulo an odd prime power pk,p^k, we need pkp^k to divide (x−1)(x+1).(x - 1)(x + 1). The prime pp cannot divide both factors, since they differ by 2,2, so x≡±1x \equiv \pm 1: there are 22 solutions. Modulo 22 there is 11 solution, modulo 44 there are 2,2, and modulo 2k2^k with k≥3k \ge 3 there are 4.4. There xx is odd, and of the even numbers x−1x - 1 and x+1x + 1 one is not a multiple of 4,4, so the other is a multiple of 2k−1.2^{k-1}. That gives x≡±1(mod2k−1),x \equiv \pm 1 \pmod{2^{k-1}}, which is ±1\pm 1 and 2k−1±12^{k-1} \pm 1 modulo 2k.2^k.
By the Chinese Remainder Theorem, the number of solutions modulo mm is the product over the prime powers in m.m. So it is a power of 2,2, and to be at least 5050 it must be at least 64=26.64 = 2^6.
With a factor 2k2^k for k≥3k \ge 3 we need at least 44 odd primes, and the smallest choice is 8×3×5×7×11=9240.8 \times 3 \times 5 \times 7 \times 11 = 9240. With exactly 44 dividing mm we need 55 odd primes, so m≥4×3×5×7×11×13m \ge 4 \times 3 \times 5 \times 7 \times 11 \times 13 =60060.= 60060. With at most one factor of 22 we need 66 odd primes, so m≥3×5×7×11×13×17m \ge 3 \times 5 \times 7 \times 11 \times 13 \times 17 =255255.= 255255.
The least mm is 9240,9240, and its digit sum is 9+2+4+0=15.9 + 2 + 4 + 0 = 15.
Thus, the correct answer is B.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.Terms of UsePrivacy PolicyCOPPA Privacy Policy