This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2002 AIME Problems, 8

Find the smallest integer $k$ for which the conditions $(1)$ $a_1, a_2, a_3, \ldots$ 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.