Difference between revisions of "2002 AIME I Problems/Problem 8"

Revision as of 14:14, 25 November 2007

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.

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

@@ Line 1: / Line 1: @@
-{{empty}}
 == Problem ==
 Find the smallest integer <math>k</math> for which the conditions
@@ Line 15: / Line 14: @@
 == See also ==
-* [[2002 AIME I Problems/Problem 7| Previous problem]]
+{{AIME box|year=2002|n=I|num-b=7|num-a=9}}
-* [[2002 AIME I Problems/Problem 9| Next problem]]
-* [[2002 AIME I Problems]]

2002 AIME I (Problems • Answer Key • Resources)
Preceded by Problem 7	Followed by Problem 9
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions