1999 AIME 第 1 题

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

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

1.

求最小的质数,使它是一个递增等差数列的第五项,并且前四项也都是质数。

Find the smallest prime that is the fifth term of an increasing arithmetic sequence, all four preceding terms also being prime.

答案:29
知识点:质数等差数列整除性
难度评级:1890
解答:

设这些项为 ppp+dp + d\ldotsp+4dp + 4d。如果 dd 是奇数,相邻两项奇偶性相反,因此除了第一项以外会有某一项是大于 22 的偶数,不可能是质数。如果 dd 不是 33 的倍数,那么 ppp+dp + dp+2dp + 2d 会覆盖模 33 的所有余数,所以其中一项能被 33 整除;这一项只能等于 33,从而迫使 p=3p = 3,但此时 p+3d=3(1+d)p + 3d = 3(1 + d) 是合数。因此 6d6 \mid d

因为 d6d \ge 6,第五项至少为 p+24p + 24。取 p=5p = 5d=6d = 6,得到 5,11,17,23,295, 11, 17, 23, 29,全部为质数;又因为 p5p \ge 5(以 p=2p = 2p=3p = 3 开头都会失败),不可能有更小的第五项。答案是 2929

Let the terms be p,p, p+d,p + d, ,\ldots, p+4d.p + 4d. If dd were odd, consecutive terms would have opposite parity, so some term other than the first would be even and greater than 22 — impossible. If dd were not a multiple of 3,3, then p,p, p+d,p + d, p+2dp + 2d would cover all residues mod 3,3, so some term would be divisible by 3;3; that term would have to be 33 itself, forcing p=3,p = 3, but then p+3d=3(1+d)p + 3d = 3(1 + d) is composite. Hence 6d.6 \mid d.

With d6d \ge 6 the fifth term is at least p+24.p + 24. Trying p=5p = 5 and d=6d = 6 gives 5,11,17,23,29,5, 11, 17, 23, 29, all prime, and no smaller fifth term is possible since p5p \ge 5 (the starts p=2p = 2 and p=3p = 3 fail as above). The answer is 29.29.

完整试卷

其他年份的第 1 题