2002 AIME I 第 8 题

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

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

8.

求满足下列条件的最小整数 kk

a1,a2,a3,a_1, a_2, a_3, \ldots 是一个非递减的正整数数列

• 对所有 n>2n \gt 2,都有 an=an1+an2a_n = a_{n-1} + a_{n-2}

a9=ka_9 = k

并且满足这些条件的数列不止一个。

Find the smallest integer kk for which the conditions

a1,a2,a3,a_1, a_2, a_3, \ldots is a nondecreasing sequence of positive integers

an=an1+an2a_n = a_{n-1} + a_{n-2} for all n>2n \gt 2

a9=ka_9 = k

are satisfied by more than one sequence.

答案:748
知识点:递推斐波那契数列丢番图方程
难度评级:2650
解答:

反复使用递推式得 a9=13a1+21a2a_9 = 13a_1 + 21a_2,且数列非递减当且仅当 0<a1a20 \lt a_1 \le a_2 (之后的项会自动满足)。因此我们需要找最小的 kk,使得 13x+21y=k13x + 21y = k 有两个满足 0<xy0 \lt x \le y 的解。

假设 13x+21y=13u+21v13x + 21y = 13u + 21vx<ux \lt u。则 13(ux)=21(yv)13(u - x) = 21(y - v),所以 uxu - x2121 的正倍数。因此 ux+2122u \ge x + 21 \ge 22,又因为 uvu \le v,也有 v22v \ge 22,从而 k=13u+21v3422=748k = 13u + 21v \ge 34 \cdot 22 = 748

反过来,k=748k = 748 可行:(x,y)=(1,35)(x, y) = (1, 35)(22,22)(22, 22) 分别给出数列 11353536367171107107178178285285463463748748 以及 2222222244446666110110176176286286462462748748 答案是 k=748k = 748

Iterating the recurrence gives a9=13a1+21a2,a_9 = 13a_1 + 21a_2, and the sequence is nondecreasing exactly when 0<a1a20 \lt a_1 \le a_2 (all later terms then take care of themselves). So we need the smallest kk for which 13x+21y=k13x + 21y = k has two solutions with 0<xy.0 \lt x \le y.

Suppose 13x+21y=13u+21v13x + 21y = 13u + 21v with x<u.x \lt u. Then 13(ux)=21(yv),13(u - x) = 21(y - v), so uxu - x is a positive multiple of 21.21. Hence ux+2122,u \ge x + 21 \ge 22, and since uv,u \le v, also v22,v \ge 22, giving k=13u+21v3422=748.k = 13u + 21v \ge 34 \cdot 22 = 748.

Conversely k=748k = 748 works: (x,y)=(1,35)(x, y) = (1, 35) and (22,22)(22, 22) give the sequences 1,1, 35,35, 36,36, 71,71, 107,107, 178,178, 285,285, 463,463, 748748 and 22,22, 22,22, 44,44, 66,66, 110,110, 176,176, 286,286, 462,462, 748.748. The answer is k=748.k = 748.

← 第 7 题#7
完整试卷

其他年份的第 8 题