Consider the sequence { a n } defined by a 1 = 2 2 0 1 3 and the recurrence relation
a k 1 = a 1 1 + a 2 1 + a 3 1 + ⋯ + a k − 1 1 for k > 1 .
What is the value of a 2 0 1 3 ?
This problem is posed by Kiriti M .
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.
Nice
I don't get how a1 = a2 :(
Notice,
a 2 1 = a 1 1
a 3 1 = a 1 1 + a 2 1 = a 1 2
a 4 1 = a 1 1 + a 2 1 + a 3 1 = a 3 2 = a 1 4
Through deductive reasoning,
a n 1 = a 1 2 n − 2
⇒ a 2 0 1 3 = 2 2 0 1 3 − ( 2 0 1 3 − 2 ) = 4
With complete induction ( 2 ≤ n ) it can be shown that a n = 2 n − 2 2 2 0 1 3 = 2 2 0 1 5 − n .
So: a 2 0 1 3 = 2 2 0 1 5 − 2 0 1 3 = 4 .
Let 2 2 0 1 3 = a , then we find that:
a 1 = a a 2 = a a 3 = 2 a a 4 = 4 a
In general, it can be stated that:
a n = 2 n − 2 a , n > 1
where n and a are the term number and starting value respectivley. Therefore, to calculate the 2 0 1 3 t h term, we find that:
a 2 0 1 3 = 2 2 0 1 1 2 2 0 1 3 = 2 2 = 4
It is not obvious how to proceed immediately, so let's evaluate the first few terms of the sequence. Using the recursion, we get 1 / a 2 = 1 / 2 2 0 1 3 , 1 / a 3 = 2 / 2 2 0 1 3 , 1 / a 4 = 4 / 2 2 0 1 3 and so on. One can easily show that a k 1 = 2 2 0 1 3 1 ⋅ k = 0 ∑ 2 k − 3 for every integer k greater than 1 by induction. The reciprocal of the 2 0 1 3 th term is therefore 2 2 0 1 3 1 ⋅ k = 0 ∑ k = 2 2 0 1 0 = 1 / 4 , so the answer is 1 / 4 1 = 0 0 4 .
a k 1 = a 1 1 + a 2 1 + ⋯ + a k − 1 1
⇒ a k 2 = a 1 1 + a 2 1 + ⋯ + a k − 1 1 + a k 1 = a k + 1 1
a k + 1 = 2 a k for k > 1 , and a 2 = a 1
Hence, a 2 0 1 3 = 2 2 0 1 1 a 2 = 2 2 0 1 1 a 1 = 4
we've :
a 1 = 2 2 0 1 3 and a 1 1 = 2 2 0 1 3 1
so:
a 2 1 = a 1 1 = 2 2 0 1 3 1
a 3 1 = a 2 1 + a 1 1 = 2 2 0 1 3 1 + 2 2 0 1 3 1 = 2 2 0 1 3 2
a 4 1 = a 3 1 + a 2 1 + a 1 1 = 2 2 0 1 3 2 + 2 2 0 1 3 1 + 2 2 0 1 3 1 = 2 2 0 1 3 4 = 2 2 0 1 3 2 2
a 5 1 = a 4 1 + a 3 1 + a 2 1 + a 1 1 = 2 2 0 1 3 4 + 2 2 0 1 3 2 + 2 2 0 1 3 1 + 2 2 0 1 3 1 = 2 2 0 1 3 8 = 2 2 0 1 3 2 3
so the pattern is a k 1 = a 1 2 k − 2 for k > 1 so :
a 2 0 1 3 1 = a 1 2 2 0 1 3 − 2 = 2 2 0 1 3 2 2 0 1 3 − 2 = 4 1 , a 2 0 1 3 = 4
Problem Loading...
Note Loading...
Set Loading...
First of all, note that, by simple computation, a 2 = 2 2 0 1 3 .
Next, note that for k ≥ 3 , we can make the following manipulation. Given:
a k 1 = a 1 1 + … + a k − 2 1 + a k − 1 1 a k − 1 1 = a 1 1 + a 2 1 + … + a k − 2 1
We can group together the first few terms in the first recursion to find:
a k 1 = ( a 1 1 + a 2 1 + … + a k − 2 1 ) + a k − 1 1 = a k − 1 1 + a k − 1 1 = a k − 1 2
Note the penultimate step used the recursion for a k − 1 1 to collect together the terms of a sum.
From this manipulation, we unearth the recursion a k = 2 a k − 1 valid for k > 2 .
From here, we can easily find an explicit formula, valid for k ≥ 2 :
a k = 2 2 − k a 2 = 2 2 − k × 2 2 0 1 3 = 2 2 0 1 5 − k
Plugging in k = 2 0 1 3 gives our desired answer of 4