For a recursion series if a 1 = 3 , a 2 = 6 , a 3 = 1 8 where a n = 2 a n − 1 + 5 a n − 2 − 6 a n − 3 for all n ≥ 3 .
Then the value of the following expression :
n = 0 ∑ ∞ 4 n a n comes out to be Q P , where P and Q are co-primes.
Then find the value for P Q + P + Q
And if the sum given above diverges then please give the answer as − 1 .
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.
Sir this question was made by me , and I am very inspired by your solution which I did not think could get this much simpler.
You're assuming that the series converges. You have not ruled out the possibility that the series diverges. How do you know that you did not commit the fallacy of ∞ − ∞ ?
For the recursion series given above , the characteristic polynomial will be :
x ³ = 2 x ² + 5 x − 6
Thus we get
x ³ − 2 x ² − 5 x + 6 = 0
Now we need to find the roots of this polynomial to get the closed form of the recurrence.
By vieta's formula , we can say that the roots are a factor of 6. And luckily we get that x = 1 is a root of this polynomial.
Furthermore by the factor theorem we know if x = 1 is a root , then (x-1) must be a factor or the same polynomial.
On division we get quotient equal to
x ² − x − 6
Now simply use the quadratic formula to get the roots of this polynomial
x = 2 a − b ± b 2 − 4 a c
= 2 ( 1 ) − ( − 1 ) ± ( − 1 ) 2 − 4 ( 1 ) ( − 6 )
= 2 1 ± ( 1 + 2 4 )
= 2 1 ± 5
= 3 or − 2
Finally the roots of the equation are 1 , − 2 , 3
Now we can write the closed form as
a n = x ( 1 ) n + y ( − 2 ) n + z ( 3 ) n
Put the values of a 1 , a 2 , a 3 to get three equations for x , y , z
The three equations would be :
1 . ) x − 2 y + 3 z = 3
2 . ) x + 4 y + 9 z = 6
3 . ) x − 8 y + 2 7 z = 1 8
On solving these equations we get x = 1 , y = − 1 / 1 0 , z = 3 / 5
So the closed for the recursion is: a n = ( 1 ) n + 1 0 − ( − 2 ) n + 5 3 ( 3 ) n
Let S = ∑ n = 0 ∞ 4 n a n
= n = 0 ∑ ∞ 4 n ( 1 ) n + 1 0 − ( − 2 ) n + 5 3 ( 3 ) n
= n = 0 ∑ ∞ 4 n 1 n + 1 0 − 1 n = 0 ∑ ∞ 4 n ( − 2 ) n + 5 3 n = 0 ∑ ∞ 4 n 3 n
= n = 0 ∑ ∞ ( 4 1 ) n + 1 0 − 1 n = 0 ∑ ∞ ( 2 − 1 ) n + 5 3 n = 0 ∑ ∞ ( 4 3 ) n
= 1 − 4 1 1 + ( 1 0 − 1 ) 1 − 2 − 1 1 + ( 5 3 ) 1 − 4 3 1
= 3 4 + ( 1 0 − 1 ) 3 2 + ( 5 3 ) 1 4
= 3 4 − 1 5 1 + 5 1 2
= 1 5 2 0 − 1 + 3 6
= 1 5 5 5 = 3 1 1
Thus P = 1 1 , Q = 3
and the answer is ( 1 1 ) ( 3 ) + 1 1 + 3 = 4 7
Problem Loading...
Note Loading...
Set Loading...
It's easy to derive from the given recurrance relation that a 0 = 2 3 . Let the sum be S . Then
S = 2 3 + 4 3 + 8 3 + n = 3 ∑ ∞ 4 n a n
= 8 2 1 + 2 n = 3 ∑ ∞ 4 n a n − 1 + 5 n = 3 ∑ ∞ 4 n a n − 2 − 6 n = 3 ∑ ∞ 4 n a n − 3
= 8 2 1 + 2 ( 4 S − 1 6 9 ) + 5 ( 1 6 S − 3 2 5 ) − 6 6 4 S
⟹ S ( 1 − 2 1 − 1 6 5 + 3 2 3 ) = 8 2 1 − 8 9 − 3 2 1 5
⟹ S = 3 1 1
So, P = 1 1 , Q = 3 , and P Q + P + Q = 3 3 + 1 1 + 3 = 4 7 .