2026 AMC 12A 第 25 题

先试着解答 2026 AMC 12A 第 25 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2026 AMC 12A 解答,或核对答案。

所有题目均经美国数学协会(MAA)官方合法授权使用。

25.

设正整数 mm 满足:至少有 5050 个正整数 xx 小于 mm,并且使 x2−1x^2 - 1 是 mm 的倍数。mm 的最小可能值的各位数字之和是多少?
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
答案:B
知识点:模运算中国剩余定理质因数分解
小提示:
模奇质数的幂时,x2≡1x^2 \equiv 1 有 22 个解。模 22、44 和 2k2^k(k≥3k \ge 3)时,分别有 11、22 和 44 个解。
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.
大提示:
由中国剩余定理,解数相乘,所以解数必须达到 6464
By the Chinese Remainder Theorem the counts multiply, so the count must reach 6464
解答:
我们要数的是 x2≡1(modm)x^2 \equiv 1 \pmod{m} 在 1,2,…,m−11, 2, \ldots, m - 1 中的解。当 m>1m \gt 1 时,这就是模 mm 的全部解,因为 x=0x = 0 永远不是解。
模奇质数的幂 pkp^k 时,需要 pkp^k 整除 (x−1)(x+1)(x - 1)(x + 1)。质数 pp 不能同时整除这两个因式,因为它们相差 22,所以 x≡±1x \equiv \pm 1:共有 22 个解。模 22 有 11 个解,模 44 有 22 个解,而模 2k2^k(k≥3k \ge 3)有 44 个解。此时 xx 是奇数,在偶数 x−1x - 1 和 x+1x + 1 中有一个不是 44 的倍数,所以另一个是 2k−12^{k-1} 的倍数。由此得 x≡±1(mod2k−1)x \equiv \pm 1 \pmod{2^{k-1}},也就是 ±1\pm 1 和 2k−1±12^{k-1} \pm 1(模 2k2^k)。
由中国剩余定理,模 mm 的解数等于 mm 中各个质数幂所对应解数的乘积。所以它是 22 的幂,而要至少为 5050,它必须至少是 64=2664 = 2^6。
如果含有因子 2k2^k(k≥3k \ge 3),则至少需要 44 个奇质数,最小的选择是 8×3×5×7×11=92408 \times 3 \times 5 \times 7 \times 11 = 9240。如果 44 恰好整除 mm,则需要 55 个奇质数,所以 m≥4×3×5×7×11×13m \ge 4 \times 3 \times 5 \times 7 \times 11 \times 13 =60060= 60060。如果至多只含一个因子 22,则需要 66 个奇质数,所以 m≥3×5×7×11×13×17m \ge 3 \times 5 \times 7 \times 11 \times 13 \times 17 =255255= 255255。
最小的 mm 是 92409240,它的各位数字之和为 9+2+4+0=159 + 2 + 4 + 0 = 15。
因此,正确答案是 B。
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
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.使用条款隐私政策COPPA 隐私政策