How do you find a limit of \[\lim{\sqrt{2+\sqrt{2 + \sqrt{2 + \sqrt{...}}}}} =\,\, ?\] ?
is there a variable or it just limit of a const
Yes - the variable is the number of nested operations e.g.\[ a_2= \sqrt{2+\sqrt{2}}\]
so \[ \lim_{n\to \infty}a_n \]
aha, so its basically testing the convergence of divergence of this sequence using limit
use the root test to do so
more than that : THE QUESTION IS THE LIMIT VALUE, Also I am quite scepical as to the easiness of root test application here ...
It is surely more than 1.414 !!!!!
It is involved, but yes.
HEllo Messrs. @experimentX and @CliffSedge
Uggh ... stop calling me Messrs ... I'm not a woman!!
It looks like it converges to 2 (and rather quickly).
LOL @experimentX He's not calling us women, he's calling us French!
French ... Woops!! @Mikael how many language do you know??
\[a_{n+1}=\sqrt{2+a_n}\] Recursion?
How do you prove the convergence itself ???
Hmm, trying to find a way to explain it . . .
Well here is an idea 1) Show that the sequence is increasing 2) Show it is bounded by \[\sqrt{2+2}\]
Then fundam. theorem says it converges
2) is "un peu" trickeeee...
Good night guys!!
Sleep well and dream of mathless bliss !
I guess I'm thinking of it this way: \[a_{n+1}=\sqrt{2+a_n}\] \[\rightarrow (a_{n+1})^2 = 2+a_n\] And a_n is always the same, and it began as 2. Not very rigorous, but that's how my mind sees what's happening.
OK and the "coup de grace" is : what is the Limmit?
You wrote it !
IT IS CALLED FIXED POINT EQUATION\[a_n = a_{n+1}\]
\[ LIMIT=\sqrt{2+LIMIT}\]
Yes, it converges to 2 like I said before.
Aha, and some courtesy to the guide .....
My guide was MS-Excel, actually, but thanks for the fun question.
Tahnks
Thanks @hartnn - I am glad that we share a taste for the esthetic
me too :D good question!
I plan to create and post a generalized idea , which in mathematics is ubiquitious and very effective - the idea of \[\Large\bf\text{Fixed Point Solution}\] can you guess and suggest some directions of generalization of that ?
sorry, heard that for first time.....
Well e.g. Newton-Rapson algorithm is in fact a fixed point solution to any f(x)=0 equation using derivatives
Here is the MAJOR IDEA: Theorem: Fixed point of Contracting Mappings in Banach space Assume that \[dist(f(x_1),f(x_2))<r*dist(x_1,x_2)\] where r=const<1
Then the mapping f possesses a fixed point solution, and that solution is unique \[\Large f(x)= x\]
One has to assume that the mapping f acts on a compact set K in some complete space B, and it is into that set K \[f:K\,\rightarrow K\]
That's it
i m not qualified enough to understand that....never studied such things.......sorry.
Hey you and I are not judges - we are mutual knowledge "growers" just pointed you the idea that leads to many more places, and can be easily read upon.
http://en.wikipedia.org/wiki/Banach_fixed-point_theorem http://www.math.ucdavis.edu/~hunter/book/ch3.pdf http://en.wikipedia.org/wiki/Contraction_mapping
oh..i will surely go through them.....thanks for the references...
That is just some very popular down-to-applications-earth application . Taken from the second reference above
http://www.wolframalpha.com/input/?i=plot+y%3Dsqrt%282+%2Bx%29%2C+y+%3Dx+from+x%3D1+to+2
Thanx @Mikael I really enjoy when you post some thing......
@sauravshakya it includes this topic http://www.math.ucdavis.edu/~hunter/book/ch3.pdf But MUCH BETTER TO READ FROM THE BEGINNING http://www.math.ucdavis.edu/~hunter/book/
Thanks , friend !
Can I ask a question?
Ask away !
WELL what is the solution of this:|dw:1348918479490:dw| I am tired of doing this..........
Join our real-time social learning platform and learn together with your friends!