Difference between revisions of "2002 AIME I Problems/Problem 8"
(→Problem) |
(→Problem) |
||
| Line 4: | Line 4: | ||
(1) <math>a_1,a_2,a_3\cdots</math> is a nondecreasing sequence of positive integers | (1) <math>a_1,a_2,a_3\cdots</math> is a nondecreasing sequence of positive integers | ||
| + | |||
(2) <math>a_n=a_{n-1}+a_{n-2}</math> for all <math>n>2</math> | (2) <math>a_n=a_{n-1}+a_{n-2}</math> for all <math>n>2</math> | ||
| + | |||
(3) <math>a_9=k</math> | (3) <math>a_9=k</math> | ||
Revision as of 15:36, 25 September 2007
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 
for which the conditions
(1) 
is a nondecreasing sequence of positive integers
(2) 
for all 
(3) 
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.
