Difference between revisions of "2013 AMC 12A Problems/Problem 21"
(→Video Solution by Richard Rusczyk) |
m (minor edit) |
||
Line 1: | Line 1: | ||
− | ==Problem== | + | == Problem == |
− | Consider <math> A = \log (2013 + \log (2012 + \log (2011 + \log (\cdots + \log (3 + \log 2) \cdots )))) </math>. Which of the following intervals contains <math> A </math>? | + | Consider <math>A = \log (2013 + \log (2012 + \log (2011 + \log (\cdots + \log (3 + \log 2) \cdots ))))</math>. Which of the following intervals contains <math>A</math>? |
<math> \textbf{(A)} \ (\log 2016, \log 2017) </math> | <math> \textbf{(A)} \ (\log 2016, \log 2017) </math> | ||
Line 8: | Line 8: | ||
<math> \textbf{(E)} \ (\log 2020, \log 2021) </math> | <math> \textbf{(E)} \ (\log 2020, \log 2021) </math> | ||
− | + | == Solutions == | |
− | ==Solution 1== | + | === Solution 1 === |
− | |||
Let <math>f(x) = \log(x + f(x-1))</math> and <math>f(2) = \log(2)</math>, and from the problem description, <math>A = f(2013)</math> | Let <math>f(x) = \log(x + f(x-1))</math> and <math>f(2) = \log(2)</math>, and from the problem description, <math>A = f(2013)</math> | ||
Line 39: | Line 38: | ||
<math>(\log 2016, \log 2017)</math> | <math>(\log 2016, \log 2017)</math> | ||
− | ==Solution 2== | + | === Solution 2 === |
− | |||
Suppose <math>A=\log(x)</math>. | Suppose <math>A=\log(x)</math>. | ||
Then <math>\log(2012+ \cdots)=x-2013</math>. | Then <math>\log(2012+ \cdots)=x-2013</math>. | ||
Line 51: | Line 49: | ||
But this leaves only one answer, so we are done. | But this leaves only one answer, so we are done. | ||
− | + | === Solution 3 === | |
− | ==Solution 3== | ||
− | |||
Define <math>f(2) = \log(2)</math>, and <math>f(n) = \log(n+f(n-1)), \text{ for } n > 2.</math> We are looking for <math>f(2013)</math>. First we show | Define <math>f(2) = \log(2)</math>, and <math>f(n) = \log(n+f(n-1)), \text{ for } n > 2.</math> We are looking for <math>f(2013)</math>. First we show | ||
Line 62: | Line 58: | ||
Finally, note that <math>2012 < 10^4 - 4</math> so that the Lemma implies that <math>f(2012) < 4</math>. This means that <math>f(2013) = \log(2013+f(2012)) < \log(2017)</math>, which leaves us with only one option <math>\boxed{\textbf{(A) } (\log 2016, \log 2017)}</math>. | Finally, note that <math>2012 < 10^4 - 4</math> so that the Lemma implies that <math>f(2012) < 4</math>. This means that <math>f(2013) = \log(2013+f(2012)) < \log(2017)</math>, which leaves us with only one option <math>\boxed{\textbf{(A) } (\log 2016, \log 2017)}</math>. | ||
− | + | === Solution 4 === | |
− | |||
− | ==Solution 4== | ||
− | |||
− | |||
Define <math>f(2) = \log(2)</math>, and <math>f(n) = \log(n+f(n-1)), \text{ for } n > 2.</math> We start with a simple observation: | Define <math>f(2) = \log(2)</math>, and <math>f(n) = \log(n+f(n-1)), \text{ for } n > 2.</math> We start with a simple observation: | ||
Line 82: | Line 74: | ||
Finally, we get <math>f(2013) = \log(2013 + f(2012)) < \log(2017)</math>, which leaves us with only option <math>\boxed{\textbf{(A)}}</math>. | Finally, we get <math>f(2013) = \log(2013 + f(2012)) < \log(2017)</math>, which leaves us with only option <math>\boxed{\textbf{(A)}}</math>. | ||
− | ==Video Solution by Richard Rusczyk== | + | |
+ | === Video Solution by Richard Rusczyk === | ||
https://artofproblemsolving.com/videos/amc/2013amc12a/360 | https://artofproblemsolving.com/videos/amc/2013amc12a/360 | ||
− | + | == See Also == | |
− | |||
− | ==See Also== | ||
{{AMC12 box|year=2013|ab=A|num-b=20|num-a=22}} | {{AMC12 box|year=2013|ab=A|num-b=20|num-a=22}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 00:09, 19 October 2020
Contents
Problem
Consider . Which of the following intervals contains ?
Solutions
Solution 1
Let and , and from the problem description,
We can reason out an approximation, by ignoring the :
And a better approximation, by plugging in our first approximation for in our original definition for :
And an even better approximation:
Continuing this pattern, obviously, will eventually terminate at , in other words our original definition of .
However, at , going further than will not distinguish between our answer choices. is nearly indistinguishable from .
So we take and plug in.
Since , we know . This gives us our answer range:
Solution 2
Suppose . Then . So if , then . So . Repeating, we then get . This is clearly absurd (the RHS continues to grow more than exponentially for each iteration). So, is not greater than . So . But this leaves only one answer, so we are done.
Solution 3
Define , and We are looking for . First we show
Lemma. For any integer , if then .
Proof. First note that . Let . Then , so . Suppose the claim is true for . Then . The Lemma is thus proved by induction.
Finally, note that so that the Lemma implies that . This means that , which leaves us with only one option .
Solution 4
Define , and We start with a simple observation:
Lemma. For , .
Proof. Since , we have , so .
It follows that , and so on.
Thus .
Then .
It follows that .
Finally, we get , which leaves us with only option .
Video Solution by Richard Rusczyk
https://artofproblemsolving.com/videos/amc/2013amc12a/360
See Also
2013 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 20 |
Followed by Problem 22 |
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.