Wolstenholme’s theorem
Denote by the greatest prime number not exceeding . By Bertrand’s postulate there is a prime with . Therefore we have . If were an integer, then the sum
had to be divisible by . However its addend is not divisible by but all other addends are, whence the sum cannot be divisible by . The contradictory situation means that is not integer when .
Theorem (Wolstenholme). If is a prime number greater than 3, then the numerator of the harmonic number
is always divisible by .
Proof. Consider the polynomial
One has
(1) |
and
(2) |
where are integers. Because form a set of all modulo incongruent roots of the Fermat’s congruence (http://planetmath.org/FermatsTheorem) , one may write the identical congruence
(3) |
It may be written by Wilson’s theorem as
(4) |
being thus true for any integer . From (4) one can successively infer that divides all coefficients , i.e. that (4) actually is a formal congruence.
For the derivative of the polynomial one has
and thus
(5) |
The Taylor series (Taylor polynomial) of coincides with :
By (1), this equation implies
(6) |
Since , one has . It then follows by (6) that . And since (5) divided by gives
the assertion has been proved.
References
- 1 L. Kuipers: “Der Wolstenholmesche Satz”. – Elemente der Mathematik 35 (1980).
Title | Wolstenholme’s theorem |
---|---|
Canonical name | WolstenholmesTheorem |
Date of creation | 2013-03-22 19:14:06 |
Last modified on | 2013-03-22 19:14:06 |
Owner | pahio (2872) |
Last modified by | pahio (2872) |
Numerical id | 10 |
Author | pahio (2872) |
Entry type | Theorem |
Classification | msc 11C08 |
Classification | msc 11A07 |
Related topic | HarmonicNumber |