Difference between revisions of "2006 AIME A Problems/Problem 15"
(→See also) |
|
(No difference)
| |
Revision as of 17:50, 25 September 2007
Problem
Given that a sequence satisfies 
and 
for all integers 
find the minimum possible value of 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2006 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 14 |
Followed by Final Problem | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
