Sequence Within A Sequence 4

Consider a sequence of numbers T 1 , T 2 , T 3 , , T n T_1, T_2, T_3, \ldots, T_n ( n Z + n\in \mathbb{Z}^+ ) that satisfies the following: T 1 = 5 , d 1 = 1 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 T_2=T_1+d_1 \\ T_3=T_2+d_2 \\ \vdots \\ T_n=T_{n-1}+d_{n-1} d k = 2 d k 1 , k = 2 , 3 , 4 , , n 1 d_k=2d_{k-1},~~~k=2, 3, 4, \ldots, n-1

Find T 16 T_{16} .


<<Sequence Within A Sequence 3

Sequence Within A Sequence 5>>


This is one part of 1+1 is not = to 3 .


The answer is 32772.

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.

3 solutions

Chew-Seong Cheong
Mar 16, 2016

First few values of T n T_n show us that T n = 4 + 2 n 1 T_n = 4+2^{n-1} , but is it true for all value of n 1 n \ge 1 ? Let us prove it by induction.

We claim that T n = 4 + 2 n 1 T_n = 4+2^{n-1} .

  1. For n = 1 n=1 , T 1 = 4 + 2 1 1 = 5 T_1 = 4 + 2^{1-1} = 5 , which is as given. So the claim is true for n = 1 n=1 .
  2. Now assume that the claim is true for n n , then we have:

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 \begin{aligned} T_{\color{#D61F06}{n+1}} & = T_n + \color{#3D99F6}{d_n \quad \quad \quad \quad \quad \quad \quad \small \text{We note that } d_n = 2^{n-1}} \\ & = 4+2^{n-1} + \color{#3D99F6}{2^{n-1}} \\ & = 4 + 2^n \\ & = 4 + 2^{\color{#D61F06}{n+1}-1} \end{aligned}

\quad The claim is also true for n + 1 n+1 , therefore it is true for all n 1 n \ge 1 .

Now, we have T 16 = 4 + 2 16 1 = 32772 T_{16} = 4 + 2^{16-1} = \boxed{32772}

Harsh Khatri
Mar 15, 2016

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 d_k = 2\times d_{k-1} = 2\times 2\times d_{k-2} = 2\times 2 \times \ldots ( (k-1) times ) \times d_1= 2^{k-1}

T n = T n 1 + d n 1 T_n = T_{n-1} + d_{n-1}

T n = T n 2 + d n 2 + 2 n 2 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 = T_1 + d_1 + 2^1 + 2^2 + 2^3 + \ldots + 2^{n-2}

T n = 5 + 2 n 1 1 2 1 T_n = 5 + \frac{2^{n-1} - 1}{2-1}

T n = 5 + 2 n 1 1 T_n = 5 + 2^{n-1} - 1

T n = 4 + 2 n 1 T_n = 4 + 2^{n-1}

T 16 = 4 + 2 15 = 32772 \displaystyle \Rightarrow T_{16} = 4 + 2^{15} = \boxed{32772}

Kenneth Tan
Mar 17, 2016

We have T 2 = T 1 + d 1 T 3 = T 2 + d 2 T n = T n 1 + d n 1 T_2=T_1+d_1 \\ T_3=T_2+d_2 \\ \vdots \\ 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 T_n=T_1+d_1+d_2+d_3+\ldots+d_{n-1} From the question, we know that d 1 , d 2 , , d n 1 d_1, d_2, \ldots, d_{n-1} is a G.P. (Geometric Progression).

Suppose d k d k 1 = R , k = 2 , 3 , , n 1 \frac{d_k}{d_{k-1}}=R,~~k=2, 3, \ldots, n-1 , using the sum of G.P. formula, we now have T n = T 1 + d 1 ( R n 1 1 ) R 1 T_n=T_1+\frac{d_1(R^{n-1}-1)}{R-1}

Now, substitute n = 16 n=16 , T 1 = 5 T_1=5 , d 1 = 1 d_1=1 , R = 2 R=2 , we could get T 16 = 32772 T_{16}=32772 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...