Difference between revisions of "2017 AMC 10A Problems/Problem 1"
m |
|||
| Line 1: | Line 1: | ||
| − | ==Problem== | + | == Problem == |
What is the value of <math>(2(2(2(2(2(2+1)+1)+1)+1)+1)+1)</math>? | What is the value of <math>(2(2(2(2(2(2+1)+1)+1)+1)+1)+1)</math>? | ||
| Line 6: | Line 6: | ||
| − | ==Solution 1== | + | == Solution 1 == |
Notice this is the term <math>a_6</math> in a recursive sequence, defined recursively as <math>a_1 = 3, a_n = 2a_{n-1} + 1.</math> Thus: | Notice this is the term <math>a_6</math> in a recursive sequence, defined recursively as <math>a_1 = 3, a_n = 2a_{n-1} + 1.</math> Thus: | ||
| Line 17: | Line 17: | ||
\end{split}</cmath> | \end{split}</cmath> | ||
| − | ==Solution 2== | + | == Solution 2 == |
Starting to compute the inner expressions, we see the results are <math>1, 3, 7, 15, \ldots</math>. This is always <math>1</math> less than a power of <math>2</math>. The only admissible answer choice by this rule is thus <math>\boxed{\textbf{(C)}\ 127}</math>. | Starting to compute the inner expressions, we see the results are <math>1, 3, 7, 15, \ldots</math>. This is always <math>1</math> less than a power of <math>2</math>. The only admissible answer choice by this rule is thus <math>\boxed{\textbf{(C)}\ 127}</math>. | ||
| − | ==Solution 3== | + | == Solution 3 == |
Working our way from the innermost parenthesis outwards and directly computing, we have <math>\boxed{\textbf{(C) } 127}</math>. | Working our way from the innermost parenthesis outwards and directly computing, we have <math>\boxed{\textbf{(C) } 127}</math>. | ||
| − | ==Solution 4== | + | == Solution 4 == |
If you distribute this you get a sum of the powers of <math>2</math>. The largest power of <math>2</math> in the series is <math>64</math>, so the sum is <math>\boxed{\textbf{(C)}\ 127}</math>. | If you distribute this you get a sum of the powers of <math>2</math>. The largest power of <math>2</math> in the series is <math>64</math>, so the sum is <math>\boxed{\textbf{(C)}\ 127}</math>. | ||
| + | |||
| + | == See Also == | ||
| + | |||
| + | {{AMC10 box|year=2017|ab=A|num-b=First Problem|num-a=2}} | ||
| + | {{MAA Notice}} | ||
Revision as of 08:42, 2 September 2017
Problem
What is the value of 
?
Solution 1
Notice this is the term 
in a recursive sequence, defined recursively as 
Thus:
![\[\begin{split} a_2 = 3*2 + 1 = 7.\\ a_3 = 7 *2 + 1 = 15.\\ a_4 = 15*2 + 1 = 31.\\ a_5 = 31*2 + 1 = 63.\\ a_6 = 63*2 + 1 = \boxed{\textbf{(C)}\ 127} \end{split}\]](http://latex.artofproblemsolving.com/2/4/f/24f2ed2ffa26184a9cd739e4ebd30f4a9f3c9286.png)
Solution 2
Starting to compute the inner expressions, we see the results are 
. This is always 
less than a power of 
. The only admissible answer choice by this rule is thus 
.
Solution 3
Working our way from the innermost parenthesis outwards and directly computing, we have 
.
Solution 4
If you distribute this you get a sum of the powers of . The largest power of in the series is 
, so the sum is .
See Also
| 2017 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem First Problem |
Followed by Problem 2 | |
| 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 | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
