Prove that the sequence be defined by the recursive relationship,

converges and find the limit of the sequence.

*Proof.* First, we show that the sequence is monotonically decreasing for all . For the base case we have and

Hence, . Assume then that for all positive integers up to some we have . Then,

Thus, the sequences is monotonically decreasing. The sequence is certainly bounded below since all of the terms are greater than 0. Therefore, the sequence converges

To compute the limit of the sequence, assume the sequence converges to a finite limit (justified since we just proved that it does indeed converge). Therefore,

I do not thing that substituting limits is actually allowed, since the limit is 0, thus, 1/L = infinity? This is undefined, by Apostol theorem, where it is allowed to apply limit quotient rule only if the denominator is not zero.

The way to solve this is to use the upper bound of 1/n. The adventurer needs to show that x_n <= 1/n. This can be done by induction. After this use the squeeze theorem 0 <= x_n <= 1/n, which shows that the limit is zero.

The second to last line of the IH fails for k=0; 1/2<1/2 is NOT true. These numbers appear to be reciprocals of the fibonacci numbers btw.

Also, since the given reciprocals are increasing, can’t we say the sequence is decreasing and bounded by zero (obviously the terms don’t go negative)?

Yes, that’s exactly how I solved this problem

I meant I proved the terms are reciprocals of Fibonacci numbers and used their divergence to get the limit