Difference between revisions of "2021 Fall AMC 12B Problems/Problem 18"
MRENTHUSIASM (talk | contribs) m (Made Sol 3 more consistent by removing the title and boxing the final answer.) |
MRENTHUSIASM (talk | contribs) m (→Solution 3) |
||
Line 71: | Line 71: | ||
Isolating <math>u_k</math> in our relation <math>2u_k - 1 = v_k</math> gives us <math>u_k = \frac{v_k + 1}{2}</math>. | Isolating <math>u_k</math> in our relation <math>2u_k - 1 = v_k</math> gives us <math>u_k = \frac{v_k + 1}{2}</math>. | ||
− | Substituting into the inequality, we have <math>|\frac{v_k + 1}{2}-\frac{1}{2}| \le \frac{1}{2^{1000}}</math>. Rewriting this, we get <math>|v_k| \le \frac{1}{2^{999}}</math>. | + | Substituting into the inequality, we have <math>\left|\frac{v_k + 1}{2}-\frac{1}{2}\right| \le \frac{1}{2^{1000}}</math>. Rewriting this, we get <math>|v_k| \le \frac{1}{2^{999}}</math>. |
The sequence {<math>v_k</math>} is much easier to handle because of its simple recursive relation. Writing out a few terms shows that <math>|v_k| = \frac{1}{2^{2^k}}</math>. Now it just comes down to having <math>2^k > 999</math>, so <math>k = \boxed{\textbf{(A)}\: 10}</math>. | The sequence {<math>v_k</math>} is much easier to handle because of its simple recursive relation. Writing out a few terms shows that <math>|v_k| = \frac{1}{2^{2^k}}</math>. Now it just comes down to having <math>2^k > 999</math>, so <math>k = \boxed{\textbf{(A)}\: 10}</math>. |
Revision as of 06:46, 15 June 2022
Problem
Set , and for
let
be determined by the recurrence
This sequence tends to a limit; call it . What is the least value of
such that
Solution 1
Note that terms of the sequence lie in the interval
strictly increasing.
Since the sequence tends to the limit
we set
The given equation becomes from which
The given inequality becomes and we only need to consider
We have
By induction, it can be proven that
We substitute this into the inequality, then solve for
Therefore, the least such value of
is
~MRENTHUSIASM
Solution 2
If we list out the first few values of , we get the series
, which always seems to be a negative power of
away from
. We can test this out by setting
, where
.
Now, we get
This means that this series approaches
, as the second term is decreasing. In addition, we find that
.
We claim that , which can be proven by induction:
Base Case
We have .
Induction Step
Assuming that the claim is true, we have .
It follows that and
. Therefore, the least value of
would be
.
~ConcaveTriangle
Solution 3
We are given . Multiply this equation by
and subtract
from both sides. The equations can then be written nicely as
. Let
so that
.
Clearly, . Since the magnitude of
is less than
and because our recursive relation for
squares the previous term (and negates it), we see that as
. This means
, so
.
Isolating in our relation
gives us
.
Substituting into the inequality, we have
. Rewriting this, we get
.
The sequence {} is much easier to handle because of its simple recursive relation. Writing out a few terms shows that
. Now it just comes down to having
, so
.
~chezpotato
See Also
2021 Fall AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 17 |
Followed by Problem 19 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.