2002 AIME I Problem 8

Attempt Problem 8 of the 2002 AIME I 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 2002 AIME I solutions, or check the answer key.

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

8.

Find the smallest integer kk for which the conditions

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

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

(3)(3) a9=ka_9 = k

are satisfied by more than one sequence.

Answer: 748
Concepts:recursionFibonacciDiophantine Equation
Difficulty rating: 2650
Small Hint:

Iterate the recurrence to express the target in the first two terms: a9=13a1+21a2a_9 = 13a_1 + 21a_2

Big Hint:

If 13x+21y=13u+21v13x + 21y = 13u + 21v with x<u,x \lt u, then uxu - x is a multiple of 21,21, forcing uu and vv to be at least 2222

Solution:

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.

Problem 7#7
Full Exam

Problem 8 in Other Years