2019 AMC 10A 第 9 题

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

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

9.

最大的三位正整数 nn 是多少,使得前 nn 个正整数之和 不是nn 个正整数之积的因子?

What is the greatest three-digit positive integer nn for which the sum of the first nn positive integers is not a divisor of the product of the first nn positive integers?

995995

996996

997997

998998

999999

答案:B
知识点:阶乘整除性质数
难度评级:1420
解答:

nn 个正整数之和为 我们需要它不能整除 n!n!n(n+1)2.\dfrac{n(n + 1)}{2}.

m=n+1m=n+1 是合数,则 mm 能整除 m=abm=ab。若它可写成两个都小于 2ab2\le a\le b 的不同因数之积,这两个因数都包含在 a<ba<b 中;若它是质数的平方,aa 中也包含两份该质因子。因此 bb 能整除 (m2)!=(n1)!(m-2)!=(n-1)!a=ba=b a3a\ge3 aa 2a2a (m2)!(m-2)!a2=ma^2=m m(n1)!m\mid(n-1)!n(n+1)2n!.\frac{n(n+1)}2\mid n!.

反之,若 997997 是质数,这个质因子不会出现在 n!n! 中。因此所求条件恰好是 n+1n+1 为质数,最大的可行三位数 998,999998,99910001000 9971=996.997-1=996.

所以正确答案是 B

The sum of the first nn numbers is n(n+1)2.\dfrac{n(n + 1)}{2}. We need this to not divide n!.n!.

Put m=n+1m=n+1. If mm is composite, write m=abm=ab with 2ab2\le a\le b. When a<ba<b, the distinct factors aa and bb both occur in (m2)!=(n1)!(m-2)!=(n-1)!. When a=ba=b, we have a3a\ge3, and the two multiples aa and 2a2a both occur in (m2)!(m-2)!, so a2=ma^2=m divides that factorial as well. Thus m(n1)!m\mid(n-1)!, and consequently n(n+1)2n!.\frac{n(n+1)}2\mid n!.

Conversely, if n+1n+1 is prime, that prime factor does not occur in n!n!, so the divisibility fails. Since 997997 is prime while 998,999,998,999, and 10001000 are composite, the greatest three-digit value is 9971=996.997-1=996.

Thus, B is the correct answer.

← 第 8 题#8
完整试卷

其他年份的第 9 题