1 + 2 ⋅ ( 1 + 2 ⋅ ( 1 + 2 ⋅ ( … ⋅ ( 1 + 2 ) … ) ) )
There are 2016 pairs of parentheses in the expression above. What is the value of this expression?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great explanation. To keep to the presentation of the problem, it would be better to state that x n + 1 = 1 + 2 x n instead, which follows immediately from seeing the substitution.
1 + 2 1 + 2 ( 1 + 2 ) 1 + 2 ( 1 + 2 ( 1 + 2 ) ) 1 + 2 ( 1 + 2 ( 1 + 2 ( 1 + 2 ) ) ) 1 + 2 ( 1 + 2 ( 1 + 2 ( 1 + 2 ( 1 + 2 ) ) ) ) = 3 = 7 = 1 5 = 3 1 = 6 3 = 2 2 − 1 = 2 3 − 1 = 2 4 − 1 = 2 5 − 1 = 2 6 − 1
So, we see that the expresson with n parentheses = 2 n + 2 − 1
So, the expression with 2 0 1 6 parentheses = 2 2 0 1 6 + 2 − 1 = 2 2 0 1 8 − 1
Problem Loading...
Note Loading...
Set Loading...
Denote x 1 = 3 , x n + 1 = 2 x n + 1 for n ≥ 1 . The problem is equivalent to finding x 2 0 1 7 .
Observe that x 1 = 3 , x 2 = 7 , x 3 = 1 5 , x 4 = 3 1 , this leads naturally to the conjecture that x n = 2 n + 1 − 1 .
Substituting this into our recurrence equation x n + 1 = 2 x n + 1 , we find that
L.H.S. = 2 n + 2 − 1
R.H.S. = 2 ( 2 n + 1 − 1 ) + 1 = 2 n + 2 − 1
L.H.S. = R.H.S., so the conjecture is true.
Therefore, x 2 0 1 7 = 2 2 0 1 8 − 1