Let T 0 = 2 , T 1 = 3 , T 2 = 6 , and for n ≥ 3 , T n = ( n + 4 ) T n − 1 − 4 n T n − 2 + ( 4 n − 8 ) T n − 3 . The first few terms are 2 , 3 , 6 , 1 4 , 4 0 , 1 5 2 , 7 8 4 , 5 1 6 8 , 4 0 5 7 6 , 3 6 3 3 9 2 . Find a formula for T n of the form T n = A n + B n , where { A n } and { B n } are well-known sequences.
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.
Problem Loading...
Note Loading...
Set Loading...
Let us prove by induction that the claim T n = n ! + 2 n is true for all n ≥ 0 .
Proof: For n = 0 , 1 , 2 , T 0 = 0 ! + 2 0 = 2 , T 1 = 1 ! + 2 1 = 3 , T 2 = 2 ! + 2 2 = 6 , all as given, hence the claim is true for n = 0 , 1 , 2 .
Now, assuming that the claim is true for n − 3 , n − 2 and n − 1 , then:
T n = ( n + 4 ) T n − 1 − 4 n T n − 2 + ( 4 n − 8 ) T n − 3 = ( n + 4 ) ( ( n − 1 ) ! + 2 n − 1 ) − 4 n ( ( n − 2 ) ! + 2 n − 2 ) + 4 ( n − 2 ) ( ( n − 3 ) ! + 2 n − 3 ) = n ! + 4 ( n − 1 ) ! − 4 n ( n − 2 ) ! + 4 ( n − 2 ) ! + ( 4 n + 1 6 − 8 n + 4 n − 8 ) 2 n − 3 = n ! + 2 n
Therefore, the claim is also true for n and hence T n = n ! + 2 n is true for all n ≥ 0 .