Consider the sequence a 1 = 3 , a 2 , a 3 , … , where a k + 1 1 = a 1 1 + a 2 1 + ⋯ + a k 1 for all integers k ≥ 1 .
Find a 2 0 1 6 .
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.
We have a 1 = 3 .
First, we have to find the value of a 2 , a 3 , a 4 , . . . . . . so we can determine the sequence.
For k = 1 , we have
a 2 1 = a 1 1
So we have a 1 = a 2 = 3 .
For k = 2 , we have
a 3 1 = a 1 1 + a 2 1
Then we have a 3 1 = 3 2
For k = 3 , we have
a 4 1 = ( a 1 1 + a 2 1 ) + a 3 1
a 4 1 = 2 × a 3 1
a 4 1 = 3 4
So we can conclude that a n 1 = 3 2 n − 2
Now, a 2 0 1 6 1 = 3 2 2 0 1 4
a 2 0 1 6 = 2 2 0 1 4 3
Problem Loading...
Note Loading...
Set Loading...
For k > 1 , we have
a k + 1 1 a k + 1 1 a k + 1 1 a k a k + 1 = a 1 1 + a 2 1 + ⋯ + a k 1 = a k 1 + a k 1 = a k 2 = 2 1
This is simply the Geometric Progression! Each term is divided by 2, hence we have a 2 0 1 6 = 2 2 0 1 4 3 .