Proof. First estimation of
.
Write
the class of
in
. By definition of
,
By Wilson’s theorem,
, thus
Moreover
. If we write
, by Fermat’s theorem,
is an integer, and
Therefore, using
for all
,
We obtain
, so
. The solution is done. To conclude,
(By problem (10), we have also
Second estimation of
.
Let
be the polynomial given by
whose roots are
We write, as in the proof of Wolstenholme’s congruence,
Here
Moreover, by definition of
,
Then
The idea is to compute two evaluations of
modulo
, to obtain
modulo
.
-
First
therefore
-
Next
By Problem 12, we know that
(even if
), thus
where we saw in the solution of exercise 2.1.18 that
Then (1) and (2) give
that is
Therefore
where the numerator is divisible by
, by(3) and Wilson’s theorem.
This is not the expected result. If we compare the two results, we obtain as promised the smart congruence, true for every odd prime,
(or equivalently
.)
□