Difference between revisions of "1984 AIME Problems/Problem 7"
(→Solution 3) |
(→Solution 3) |
||
Line 31: | Line 31: | ||
Assume that <math>f(84)</math> is to be performed <math>n</math> times. Then we have | Assume that <math>f(84)</math> is to be performed <math>n</math> times. Then we have | ||
<cmath>f^n(84)=f(f^{n-1}(84+5))</cmath> | <cmath>f^n(84)=f(f^{n-1}(84+5))</cmath> | ||
− | In order to | + | In order to find <math>f(84)</math>, we want to know the smallest value of <math>n</math> such that |
<cmath>f^{n-1}(84+5)\ge1000</cmath> | <cmath>f^{n-1}(84+5)\ge1000</cmath> | ||
Revision as of 15:09, 19 August 2019
Problem
The function f is defined on the set of integers and satisfies
Find .
Solution 1
Define , where the function is performed times. We find that . . So we now need to reduce .
Let’s write out a couple more iterations of this function: So this function reiterates with a period of 2 for . It might be tempting at first to assume that is the answer; however, that is not true since the solution occurs slightly before that. Start at :
Solution 2
We start by finding values of the function right under since they require iteration of the function.
Soon we realize the for integers either equal or based on it parity. (If short on time, a guess of or can be taken now.) If is even if is odd . has even parity, so . The result may be rigorously shown through induction.
Solution 3
Assume that is to be performed times. Then we have In order to find , we want to know the smallest value of such that
See also
1984 AIME (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 |