Difference between revisions of "2019 AMC 10B Problems/Problem 24"
(→Problem) |
(→Solution 1) |
||
Line 8: | Line 8: | ||
<math>\textbf{(A) } [9,26] \qquad\textbf{(B) } [27,80] \qquad\textbf{(C) } [81,242]\qquad\textbf{(D) } [243,728] \qquad\textbf{(E) } [729,\infty)</math> | <math>\textbf{(A) } [9,26] \qquad\textbf{(B) } [27,80] \qquad\textbf{(C) } [81,242]\qquad\textbf{(D) } [243,728] \qquad\textbf{(E) } [729,\infty)</math> | ||
+ | == Solution 1 == | ||
We first prove that <math>x_n > 4</math> for all <math>n \ge 0</math> by induction from | We first prove that <math>x_n > 4</math> for all <math>n \ge 0</math> by induction from | ||
<cmath> | <cmath> |
Revision as of 20:38, 14 February 2019
- The following problem is from both the 2019 AMC 10B #24 and 2019 AMC 12B #22, so both problems redirect to this page.
Problem
Define a sequence recursively by and for all nonnegative integers Let be the least positive integer such that In which of the following intervals does lie?
Solution 1
We first prove that for all by induction from and then prove 's are decreasing by Now we need to estimate the value of by since 's are decreasing, are also decreasing, so we have and which leads to The problem requires us to find the value of such that and using natural logarithm, we need and , or
and
As estimations, and , we can estimate that Choose C
See Also
2019 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
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 10 Problems and Solutions |
2019 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 21 |
Followed by Problem 23 |
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.