Take the 2-minute tour ×

Let f: be a positive integer defined recursively by $f(1)=1$ and $f(n+1)=\sqrt{2+f(n)}$ for all integers n. Prove that $f(n)<2$.

I am supposed to prove this by using proof of induction. I've tested the base case of 1, and I've let $P(n)$ be the statement that $f(n)<2$. I'm not sure how to go about the rest. I can't seem to prove that it is true for the case of $n+1$.

share|improve this question
See this closely related answer for a standard approach to these problems. –  Andres Caicedo Sep 29 '13 at 18:17
Wrong title. $ $ –  Did Sep 29 '13 at 18:19

1 Answer 1

Hint: $\sqrt{2+2}=2$. ${}{}{}{}{}{}$

share|improve this answer

Your Answer


