nth convergent as a series
First, we will prove the following claim via mathematical induction
Claim—For all positive integers
, then

Proof
The case
is trivial.
Suppose the claim is true for
. By using the two recurrence relation above, it follows that

which finishes the induction step.
By dividing both sides of the claim by
, the equation becomes

Thus,

Absolute value of nth convergent as a series
Now suppose that
for all
. Using the recurrence relation of
, note that

Thus,

Since
by assumption, then by using mathematical induction, one can show that

Consequently, the sequence of
is monotone nondecreasing and bounded from below by
. Moreover,

Since the right-hand side forms a telescoping series, it is easy to see that

for all values of
. Furthermore, the nondecreasing property of the sequence
also implies the nondecreasing property of the sequence
. Thus, the sequence
must converge, by the monotone convergence theorem.
Note that the left-hand side is the upper bound of series representation of
after applying triangle inequality, which completes the proof.