2002 AIME I Problems/Problem 8

Revision as of 16:36, 25 September 2007 by 1=2 (talk | contribs) (Problem)

This is an empty template page which needs to be filled. You can help us out by finding the needed content and editing it in. Thanks.

Problem

Find the smallest integer $k$ for which the conditions

(1) $a_1,a_2,a_3\cdots$ is a nondecreasing sequence of positive integers

(2) $a_n=a_{n-1}+a_{n-2}$ for all $n>2$

(3) $a_9=k$

are satisfied by more than one sequence.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also