Consider a sequence of numbers T 1 , T 2 , T 3 , … , T n ( n ∈ Z + ) that satisfies the following: T 1 = 5 , d 1 = 1 T 2 = T 1 + d 1 T 3 = T 2 + d 2 ⋮ T n = T n − 1 + d n − 1 d k = 2 d k − 1 , k = 2 , 3 , 4 , … , n − 1
Find T 1 6 .
<<Sequence Within A Sequence 3
Sequence Within A Sequence 5>>
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.
d k = 2 × d k − 1 = 2 × 2 × d k − 2 = 2 × 2 × … ( ( k − 1 ) t i m e s ) × d 1 = 2 k − 1
T n = T n − 1 + d n − 1
T n = T n − 2 + d n − 2 + 2 n − 2
T n = T 1 + d 1 + 2 1 + 2 2 + 2 3 + … + 2 n − 2
T n = 5 + 2 − 1 2 n − 1 − 1
T n = 5 + 2 n − 1 − 1
T n = 4 + 2 n − 1
⇒ T 1 6 = 4 + 2 1 5 = 3 2 7 7 2
We have T 2 = T 1 + d 1 T 3 = T 2 + d 2 ⋮ T n = T n − 1 + d n − 1 Add all these equations together, cancelling out all the like terms we get T n = T 1 + d 1 + d 2 + d 3 + … + d n − 1 From the question, we know that d 1 , d 2 , … , d n − 1 is a G.P. (Geometric Progression).
Suppose d k − 1 d k = R , k = 2 , 3 , … , n − 1 , using the sum of G.P. formula, we now have T n = T 1 + R − 1 d 1 ( R n − 1 − 1 )
Now, substitute n = 1 6 , T 1 = 5 , d 1 = 1 , R = 2 , we could get T 1 6 = 3 2 7 7 2 .
Problem Loading...
Note Loading...
Set Loading...
First few values of T n show us that T n = 4 + 2 n − 1 , but is it true for all value of n ≥ 1 ? Let us prove it by induction.
We claim that T n = 4 + 2 n − 1 .
T n + 1 = T n + d n We note that d n = 2 n − 1 = 4 + 2 n − 1 + 2 n − 1 = 4 + 2 n = 4 + 2 n + 1 − 1
The claim is also true for n + 1 , therefore it is true for all n ≥ 1 .
Now, we have T 1 6 = 4 + 2 1 6 − 1 = 3 2 7 7 2