Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

$\sqrt{1+\sqrt{2+\sqrt{3+\cdots+\sqrt{2006}}}}<2$. I struggled on it, but i did't find any pattern to solve it.

share|cite|improve this question
Welcome to math.SE: since you are new, I wanted to let you know a few things about the site. In order to get the best possible answers, it is helpful if you say in what context you encountered the problem, and what your thoughts on it are; this will prevent people from telling you things you already know, and help them give their answers at the right level. – Julian Kuelshammer May 28 '13 at 11:12
Does anyone know the limit of $\sqrt{1+\sqrt{2+\sqrt{3+\cdots +\sqrt{n}}}}$ in closed form? – lhf May 28 '13 at 11:49
@OlayinkaSF, thanks for the link! – lhf May 29 '13 at 1:18
up vote 8 down vote accepted

$$\begin{aligned}\sqrt{1+\sqrt{2+\sqrt{3+\cdots \sqrt{n}}}}&<\sqrt{1+\sqrt{2+\sqrt{2^2+\cdots \sqrt{2^{2^{n-1}}}}}}\\&<\sqrt{1+\sqrt{2+\sqrt{2^2+\cdots }}}\\&=\sqrt{1+\sqrt{2}\cdot\sqrt{1+\sqrt{1+\cdots }}}\\&=\sqrt{1+\sqrt{2}\phi}\\&<2\end{aligned}$$

We can get a tighter bound for the limit by breaking the pattern a little further down the line:

$$\begin{aligned}\sqrt{1+\sqrt{2+\sqrt{3+\cdots \sqrt{n}}}}&<\sqrt{1+\sqrt{2+\sqrt{3+\sqrt{2^2+\cdots}}}}\\&=\sqrt{1+\sqrt{2+\sqrt{3+2\sqrt{1+\cdots }}}}\\&=\sqrt{1+\sqrt{2+\sqrt{4+\sqrt{5}}}}\approx 1.7665398\end{aligned}$$

$$\sqrt{1+\sqrt{2+\sqrt{3+\cdots }}}\approx 1.7579327$$

share|cite|improve this answer
Very nice. And a pretty good bound too, because the limit seems to be $1.757932756618\ldots$ and $\sqrt{1+\sqrt{2}\phi} \approx 1.813352037325$. Does anyone know this limit in closed form? – lhf May 28 '13 at 11:23
In $2^{2^n}$, is there a power too much? – NikolajK May 28 '13 at 11:32

Idea: You can unwrap like this:






and so on, so we want to show

$$2006 < (((2^2-1)^2-2)^2-\cdots)^2-2005$$

might as well prove it by induction for all $n$ rather than just 2006, so we need to show that

$$n+1 < (((2^2-1)^2-2)^2-\cdots)^2-n$$


$$n+2 < ((((2^2-1)^2-2)^2-\cdots)^2-n)^2-(n+1)$$

but thats just

$$2n+3 < ((((2^2-1)^2-2)^2-\cdots)^2-n)^2$$

which holds since

$$2n+3 < (n+1)^2$$

for all $n>1$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.