Square roots

Hi, I came across this puzzle, see if you can solve it :

$$\sqrt{1 + \sqrt{1 + 2\sqrt{1 + 3\sqrt{...}}}} = ?$$

2

-- AI
P.S -> .dettimbus steg egassem taht os dedda texT

AKG
Homework Helper
For all natural n:

$$n = \sqrt{1 + (n-1)\sqrt{1 + n\sqrt{1 + (n + 1)\sqrt{\dots }}}}$$

For n = 1, we see the right side is:

$$\sqrt{1 + 0\sqrt{\dots }} = \sqrt{1} = 1$$

Note that for now, we're assuming that what we're looking at is even a number, and doesn't go to infinity. Next, assume that:

$$k = \sqrt{1 + (k-1)\sqrt{1 + k\sqrt{1 + (k + 1)\sqrt{\dots }}}}$$

for some natural k. Then:

$$k+1 = \frac{(k - 1)(k + 1)}{(k - 1)}$$
$$= \frac{k^2 - 1}{k - 1}$$

$$= \frac{\left (\sqrt{1 + (k-1)\sqrt{1 + k\sqrt{1 + (k + 1)\sqrt{\dots }}}}\right )^2 - 1}{k - 1}$$

$$= \frac{(k - 1)\sqrt{1 + k\sqrt{1 + (k + 1)\sqrt{\dots }}}}{k - 1}$$

$$= \sqrt{1 + k\sqrt{1 + (k + 1)\sqrt{\dots }}}$$​
as required.

From this, TenaliRaman's answer follows. It remains to prove, however, that the stuff really is a number and doesn't "diverge". Any ideas as to how to prove that?

Last edited:
Do i prove this with series? Don't have my Calculus book with me... I got to the part of general representation, the last part of k-expression...

There is a bit easier way to go abt the above,
Let f(x) = x+1
f(x)
= sqrt((x+1)^2)
= sqrt(x^2 + 2x + 1)
= sqrt(1 + x (x+2))
= sqrt(1 + xf(x+1))

Recursively applying the above gives,
f(x) = sqrt(1+x*sqrt(1+(x+1)*sqrt(1+(x+2)*sqrt(......))) = x + 1
place x = 1 and et voila!

-- AI

ahhh, i see... how did you see that?

EvLer said:
ahhh, i see... how did you see that?
Its one of those *aha* moments. Personally, these sort of "functional equations" are good fun to play around with (i have played with this one, quite a while back). Just remember the trick i used above and try to come up with some more radicals just like those.

For example,
f(x) = x + a = sqrt(x^2+2ax+a^2) = sqrt(a^2+x*f(x+a))
Recursively apply the above and get a new oh_so_cool radical expression, fit in a value for a and set some value for x and give it to your friends to torture them for a while.

Note in all of the above, its important to analyse that the infinite recursion is valid and that the infinite recursion actually converges. This aspect ofcourse i have pushed under the rug for now, since its a puzzle after all :tongue2: .

There is a paper by T Vijayaraghavan (IIRC) which discussed convergence issues of such radicals, which could probably be the starting point of such analysis.

-- AI

cool, thanks! yeah...i guess if you do a lot of these, you kind of develop an intuition.
TenaliRaman said:
There is a paper by T Vijayaraghavan (IIRC) which discussed convergence issues of such radicals, which could probably be the starting point of such analysis.
have a link? or a reference?

AKG
Homework Helper
TenaliRaman said:
Note in all of the above, its important to analyse that the infinite recursion is valid and that the infinite recursion actually converges.
How would you check that the recursion is valid? EDIT: actually, since each step in the recursion produces the same number, why would the infinite recursion be any different? If it is different, what we have to do to check convergence?

Last edited:
AKG said:
How would you check that the recursion is valid?
When i said recursion being valid, i meant, making sure that the final number doesnt change by infinite application of recursion.

actually, since each step in the recursion produces the same number, why would the infinite recursion be any different?
umm, let me try and give an example,
Let f(x) = x
f(x) = x = (x+1) - 1
f(x) = f(x+1)-1
.....-3-2-1 = f(x) = x ,for any x
I guess this example is pretty lame but i hope it drives home the point.

If it is different, what we have to do to check convergence?
I am not sure whether there is a convergence check (the paper i mentioned above, discusses convergence of infinite radicals IIRC and not exactly recursion, and to be honest, when i had read that paper, i couldnt understand a penny out of it, :uhh: cmon i am just 21 and an engineer at that so give me a break ) .

However, i guess one could model the convergence condition as that in the convergence of a series,
Let R(k,f(x)) denote the value of recursive function f(x) at depth k.
Then a possible convergence condition would be,
R(1,f(x)) = R(2,f(x)) = R(k,f(x)) = R(k+1,f(x))

-- AI

EvLer said:
have a link? or a reference?
If i had, i would have definitely linked to it in the original post. I dont even remember where i had read it, it was quite a long time back. Hell i was a toddler in maths when i had read that, i was just able to quote that paper because i had read that in reference to Srinivasa Ramanujan, who btw was the brains behind such infinite radicals.

-- AI

Hurkyl
Staff Emeritus
Gold Member
Let R(k,f(x)) denote the value of recursive function f(x) at depth k.
Then a possible convergence condition would be,
R(1,f(x)) = R(2,f(x)) = R(k,f(x)) = R(k+1,f(x))

Why not apply the usual condition for convergence of a sequence? :tongue2:

I.E. does this limit exist?

$$\lim_{k \rightarrow \infty} R(k, f)$$

Hurkyl said:
Why not apply the usual condition for convergence of a sequence? :tongue2:

I.E. does this limit exist?

$$\lim_{k \rightarrow \infty} R(k, f)$$
Indeed!
Damn, my post looks stupid now!

-- AI