Stolz–Cesàro theorem
Stolz–Cesàro theorem is a powerful tool for evaluating limits of sequences, and it is a discrete version of L'Hôpital's rule.
Theorem 1 (the case):
Let and be two sequences of real numbers such that
(a) and .
(b) .Then, exists and is equal to .
Theorem 2 (the case):
Let and be two sequences of real numbers such that
(a) .
(b) is strictly decreasing.
(c) .Then, exists and is equal to .
Theorem 3 (Reciprocal of Stolz–Cesàro lemma):
Let and be two sequences of real numbers such that
(a) and .
(b) .
(c) .Then, exists and is equal to .
Theorem 3 (Multiplicative property):
If the sequence has a limit, then .
The previous limit is equal to a number of the form where and are two coprime natural numbers. Find
Let be a sequence such that the above limit satisfies, and where for every . Then find the value of .
Consider the sequence, find .
Let denote the number of digits in . For instance, since , we have .
Compute the limit
Compute