Difference between revisions of "2006 AIME I Problems/Problem 15"
m |
m (→See also) |
||
| Line 6: | Line 6: | ||
== See also == | == See also == | ||
| − | + | {{AIME box|year=2006|n=I|num-b=14}} | |
| − | |||
Revision as of 21:18, 11 March 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 I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 14 |
Followed by [[2006 AIME I Problems/Problem {{{num-a}}}|Problem {{{num-a}}}]] | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
