Difference between revisions of "2022 AMC 12B Problems/Problem 9"
Bxiao31415 (talk | contribs) (Created page with "== Problem == The sequence <math>a_0,a_1,a_2,\cdots</math> is a strictly increasing arithmetic sequence of positive integers such that<cmath>2^{a_7}=2^{27} \cdot a_7.</cmath>W...") |
(→Solution 1) |
||
(4 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | The sequence <math>a_0,a_1,a_2,\cdots</math> is a strictly increasing arithmetic sequence of positive integers such that<cmath>2^{a_7}=2^{27} \cdot a_7.</cmath>What is the minimum possible value of <math>a_2</math>? | + | The sequence <math>a_0,a_1,a_2,\cdots</math> is a strictly increasing arithmetic sequence of positive integers such that <cmath>2^{a_7}=2^{27} \cdot a_7.</cmath> What is the minimum possible value of <math>a_2</math>? |
− | <math>\textbf{(A)}8 \qquad \textbf{(B)}12 \qquad \textbf{(C)}16 \qquad \textbf{(D)}17 \qquad \textbf{(E)}22</math> | + | <math>\textbf{(A)}\ 8 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 16 \qquad \textbf{(D)}\ 17 \qquad \textbf{(E)}\ 22</math> |
== Solution 1 == | == Solution 1 == | ||
− | We can rewrite the given equation as <math>2^{a_7-27}=a_7</math>. Hence <math>a_7</math> must be a power of <math>2</math> larger than <math>27</math>. The first power of 2 larger than <math>27</math>, namely <math>32</math>, does | + | We can rewrite the given equation as <math>2^{a_7-27}=a_7</math>. Hence, <math>a_7</math> must be a power of <math>2</math> and larger than <math>27</math>. The first power of 2 that is larger than <math>27</math>, namely <math>32</math>, does satisfy the equation: <math>2^{32 - 27} = 2^5 = 32</math>. In fact, this is the only solution; <math>2^{a_7-27}</math> is exponential whereas <math>a_7</math> is linear, so their graphs will not intersect again. |
− | Now, let the common difference in the sequence be <math>d</math>. Hence <math>a_0 = 32 - 7d</math> and <math>a_2 = 32 - 5d</math>. To minimize <math>a_2</math>, we maxmimize <math>d</math>. Since the sequence contains only positive integers, <math>32 - 7d > 0</math> and hence <math>d \leq 4</math>. When <math>d = 4</math>, <math>a_2 = \ | + | Now, let the common difference in the sequence be <math>d</math>. Hence, <math>a_0 = 32 - 7d</math> and <math>a_2 = 32 - 5d</math>. To minimize <math>a_2</math>, we maxmimize <math>d</math>. Since the sequence contains only positive integers, <math>32 - 7d > 0</math> and hence <math>d \leq 4</math>. When <math>d = 4</math>, <math>a_2 = \boxed{\textbf{(B)}\ 12}</math>. |
~[[User:Bxiao31415|Bxiao31415]] | ~[[User:Bxiao31415|Bxiao31415]] | ||
+ | |||
+ | |||
+ | ==Video Solution (Under 2 min!)== | ||
+ | https://youtu.be/N_v7AXXsRfo | ||
+ | |||
+ | ~<i>Education, the Study of Everything</i> | ||
+ | |||
+ | ==Video Solution(1-16)== | ||
+ | https://youtu.be/SCwQ9jUfr0g | ||
+ | |||
+ | ~~Hayabusa1 | ||
== See also == | == See also == | ||
{{AMC12 box|year=2022|ab=B|num-b=8|num-a=10}} | {{AMC12 box|year=2022|ab=B|num-b=8|num-a=10}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 22:04, 9 July 2023
Problem
The sequence is a strictly increasing arithmetic sequence of positive integers such that What is the minimum possible value of ?
Solution 1
We can rewrite the given equation as . Hence, must be a power of and larger than . The first power of 2 that is larger than , namely , does satisfy the equation: . In fact, this is the only solution; is exponential whereas is linear, so their graphs will not intersect again.
Now, let the common difference in the sequence be . Hence, and . To minimize , we maxmimize . Since the sequence contains only positive integers, and hence . When , .
Video Solution (Under 2 min!)
~Education, the Study of Everything
Video Solution(1-16)
~~Hayabusa1
See also
2022 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 8 |
Followed by Problem 10 |
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.