Consider a sequence of numbers T 1 , T 2 , T 3 , … , T n ( n ∈ Z + ) that satisfies the following: T 1 = 1 1 5 6 , d 1 = 1 1 5 3 T 2 = T 1 + d 1 T 3 = T 2 + d 2 ⋮ T n = T n − 1 + d n − 1 d k = d k − 1 − 3 , k = 2 , 3 , 4 , … , n − 1
Denote, S a = T 1 + T 2 + … + T a , find the value of n if S n = 0 .
<<Sequence Within A Sequence 2
Sequence Within A Sequence 4>>
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.
From Sequence Within A Sequence 2 , we know that S n = n T 1 + 6 n ( n − 1 ) [ 3 d 1 + ( n − 2 ) D ] Plugging in T 1 = 1 1 5 6 , d 1 = 1 1 5 3 , D = − 3 , S n = 0 , we have 0 = 1 1 5 6 n + 6 n ( n − 1 ) [ 3 × 1 1 5 3 − 3 ( n − 2 ) ] 2 ( n − 1 ) ( n − 1 1 5 5 ) − 1 1 5 6 = 0 2 n 2 − 1 1 5 6 n + 1 1 5 5 − 1 1 5 6 = 0 n 2 − 1 1 5 6 n − 1 1 5 7 = ( n + 1 ) ( n − 1 1 5 7 ) = 0 Since n > 0 , thus n = 1 1 5 7 .
Problem Loading...
Note Loading...
Set Loading...
We claim that T n = 2 1 n ( 2 3 1 5 − 3 n ) and prove it by induction.
T n + 1 = T n + d n We note that d n = d 1 − 3 ( n − 1 ) = 1 1 5 6 − 3 n = 2 n ( 2 3 1 5 − 3 n ) + 1 1 5 6 − 3 n = 2 2 3 1 5 n − 3 n 2 + 2 3 1 2 − 6 n = 2 2 3 1 2 + 2 3 0 9 n − 3 n 2 = 2 ( n + 1 ) ( 2 3 1 5 − 3 ( n + 1 ) )
The claim is also true for n + 1 and therefore it is true for all n ≥ 1 .
Now, we have:
S n k = 1 ∑ n T k k = 1 ∑ n 2 2 3 1 5 k − 3 k 2 4 2 3 1 5 n ( n + 1 ) − 1 2 3 n ( n + 1 ) ( 2 n + 1 ) ⇒ 2 3 1 5 n ( n + 1 ) 2 n + 1 ⇒ n = 0 = 0 = 0 = 0 = n ( n + 1 ) ( 2 n + 1 ) = 2 3 1 5 = 1 1 5 7