Coto said:
Can you write down an equation for this sequence? Something along the lines of x_i = f(x_{i-1}).
x
1 = √2, x
n+1 = √(2 + x
n).
Here's my proof so far ...
Let x
1 = √2, x
n+1 = √(2+x
n), and P(n) be the proposition that x
n < √(2+x
n).
Because 2 > 0 and √2 > 0, we know that 2 < 2 + √2. Taking the square root of both sides gives us √2 < √(2+√2), that is to say, the base case P(1).
Adding 2 to both sides of P(n) gives us xn + 2 < xn+1 + 2. Taking the square root of both sides, we then get √(x
n + 2) < √(x
n+1 + 2) = x
n+2. Thus P(n) implies P(n+1), and we can conclude that x
n < x
n+1 for all n.
Now assume x
n ≥ 2, where n > 1. Then √(2+x
n-1) ≥ 2. Squaring both sides yields 2 + x
n-1 ≥ 4, and then adding (-2) to both sides yields x
n-1 ≥ 2. Let n = 2 and our inequality implies x
1 = √2 ≥ 2, an obvious contradiction. Thus x
n < 2.
Because x
n has an upper bound, namely 2, it must have a least upper bound (see Theorem II on pg. 80). Because x
n is monotonically increasing, and because it has an upper bound, the sequence converges to its least upper bound (see Theorem III on pg. 81).
Let M be the least upper bound of x
n. We know √2 < M ≤ 2, and so 2 < M
2 ≤ 4. Because lim
n→∞ √(2 + x
n) = √(2 + lim
n→∞ x
n), it is true that 2 < 2 + lim
n→∞ x
n ≤ 4.
(The final paragraph is nonsense; I'm just experimenting and trying to find the limit)