Difference between revisions of "2009 AIME I Problems/Problem 7"
m (→Solution) |
|||
Line 13: | Line 13: | ||
== See also == | == See also == | ||
{{AIME box|year=2009|n=I|num-b=6|num-a=8}} | {{AIME box|year=2009|n=I|num-b=6|num-a=8}} | ||
+ | {{MAA Notice}} |
Revision as of 19:21, 4 July 2013
Problem
The sequence satisfies and for . Let be the least integer greater than for which is an integer. Find .
Solution
The best way to solve this problem is to get the iterated part out of the exponent: Since , we can easily use induction to show that . So now we only need to find the next value of that makes an integer. This means that must be a power of . We test : This has no integral solutions, so we try :
See also
2009 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.