QUESTION: show that the sequence defined recursively as

MY SOLUTION:

Let the sequence be bounded above. It then has a least upper bound say .

now,

hence:

It can be computed that

so we have:

This is true for all so we have:

Contradiction.

Is this correct?

also if you have a good method to do it then please post it.