The sequence { x n } is given by the recursive relation
{ x 0 x n + 1 = 0 = x n + a + b 2 + 4 a x n for n ≥ 1
where a and b are positive reals.
Find n → ∞ lim n 2 x n .
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.
As always, simple and precise.
Log in to reply
You are always very supportive of me. Thanks friend.
Problem Loading...
Note Loading...
Set Loading...
The first few n indicate that x n = a n 2 + b n . Let us prove by induction that the claim is true for all n ≥ 0 .
For n = 0 , it is given that x 0 = 0 = a ( 0 2 ) + b ( 0 ) . So the claim is true for n = 0 . Assuming the claim is true for n , then
x n + 1 = x n + a + b 2 + 4 a x n = a n 2 + b n + a + b 2 + 4 a ( a n 2 + b n ) = a ( n 2 + 1 ) + b n + b 2 + 4 a b n + 4 a 2 n 2 = a ( n 2 + 1 ) + b n + b + 2 a n = a ( n 2 + 2 n + 1 ) + b ( n + 1 ) = a ( n + 1 ) 2 + b ( n + 1 )
The claim is also true for n + 1 , therefore it is true for all n ≥ 0 . And n → ∞ lim n 2 x n = n → ∞ lim n 2 a n 2 + b n = n → ∞ lim ( a + n b ) = a .