Let
|
|
|
be the arithmetic mean of the numbers .
The sequence
|
|
|
(1) |
is said to converge in the mean iff the
sequence
|
|
|
(2) |
converges.
On has the
Theorem. If the sequence (1) is convergent having the limit , then also the sequence
(2) converges to the limit . Thus, a convergent sequence is always convergent in the mean.
Proof. Let be an arbitrary positive number. We may write
|
|
|
|
|
|
|
|
|
|
|
|
The supposition implies that there is a positive integer such that
|
|
|
Let’s fix the integer . Choose the number
so great that
|
|
|
Let now . The three above inequalities yield
|
|
|
whence we have
|
|
|
Note. The converse of the theorem is not
true. For example, if
|
|
|
i.e. if the sequence (1) has the form
then it is divergent but converges in the mean to the limit
; the corresponding sequence (2) is
Comments
Euler's generalisation of Fermat's theorem in k(i)
I will just give an example to illustrate:
((21+i)^12-1)/21 is a Gaussian integer. Needless to say we can verify this only if we have pari or similar software.
Euler's generalisation of Fermat's theorem in k(i) (contd)
Before generalising let me give another related example: ((15 + 7*I)^12-1)/21 also yields a Gaussian integer as quotient.