( a n + 1 ) 2 a n + 2 ( a n + 1 ) − a n = 0
Let a recursive sequence { a n } be defined as given above with a 0 = 1 , then evaluate n → ∞ lim [ 2 n ( a 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.
Nicely explained, Kishlaya. :)
Same method +1 . The mentioning of recursive sequence gives a big hint of using trigo
First Use Shridhacharya formula for quadratic polynomial , and get : a n + 1 = 1 + a n 2 − 1 .
Now think for some substitution ... yes trigonometry rock this time ! Just think..... So I'am only giving outline hints. Solve rest by your own... Clearly
a 0 = 1 , a 1 = 2 − 1 . . . .
Now think ..... Yes It is
a n = tan ( 2 n θ o ) : θ o = 4 π L = n → ∞ lim 2 n tan ( 2 n θ o ) = θ o = 4 π A n s .
Nice solution and Exactly what i expected @Nishu sharma btw, can there be an alternate approach?? like without trigo??
Log in to reply
Currently I don't have another approach ... Did you know any other approach ? If yes then do share it
Log in to reply
@Nishu sharma no i too don't have any seming method, i asked because brilliant is famous to provide a variety of approaches to a single prob.
There is no other approach other than trigo, by the way how much you are getting in AITS Full Test-9.
Log in to reply
how much are u getting , mine is quite low,,,,,,, ........ 232
Log in to reply
@Rajat Kharbanda – Mine is 335/360, by the way was the paper difficult.
Log in to reply
@Ronak Agarwal – Looks like you'll get anything b/w AIR 1-5
@Ronak Agarwal – geeeeeeeeeeniusssssssss, how do you get such good marks,,, plz help me .... as to how to improve my marks ..... toooooo many shit mistakes in paper 2.
Shouldn't this question be marked in Algebra category rather than Calculus because the limit wasn't a big thing to evaluate if you find the explicit form for a n
There is a different approach - using generating functions. But it would take a lot of time and energy, seriously. Yet it can be a good exercise for anyone practicing recurrence and generating functions.
Cool! great intuition powers!!!
Shridaracharya formula? Whats that?
Shridhacharya formula Refer to https://en.wikipedia.org/wiki/Sridhara
Problem Loading...
Note Loading...
Set Loading...
Rearrange the given equation as follows -
a n + 1 2 a n + 2 a n + 1 − a n = 0
⇒ a n + 1 = 1 + a n + 1 a n a n − a n + 1
The above form gives us a hint of using the following substitution -
a n = tan θ n
Thus,
a n + 1 = 1 + tan θ n tan θ n + 1 tan θ n − tan θ n + 1 = tan ( θ n − θ n + 1 )
⇒ tan θ n + 1 = tan ( θ n − θ n + 1 )
Now, the principal solution of the above recurrence is
θ n + 1 = θ n − θ n + 1 ⇒ θ n + 1 = 2 θ n
We don't consider the general solution because we'll end up with the same result.
Notice that, a 0 = tan θ 0 = 1 ⇒ θ 0 = 4 π
Therefore, the solution for the recurrence is -
θ n = 2 θ n − 1 = 2 2 θ n − 2 = ⋯ = 2 n θ 0 = 2 n + 2 π
Hence, the final solution of our initial recurrence a ( n ) is a n = tan ( 2 n + 2 π )
Now, we can easily evaluate the given limit by using the following lim x → ∞ 1 / x tan 1 / x = 1
n → ∞ lim a n 2 n = 2 n tan ( 2 n + 2 π ) = 2 n + 2 π tan ( 2 n + 2 π ) 4 π = 4 π = 0 . 7 8 5