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

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|cite|improve this question
    
See this closely related answer for a standard approach to these problems. – Andrés E. Caicedo Sep 29 '13 at 18:17
1  
Wrong title. $ $ – Did Sep 29 '13 at 18:19

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

share|cite|improve this answer

Your Answer

 
discard

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.