Proof. Let
be an odd prime number, and
. Then
.
Let
As
depends only of the class
, this product can be written
since
is a bijection. So
Since
are the roots of the polynomial
, then
are the roots of
, so
.
As
, we obtain
so
As
,
-
-
Case 1: if
, thus
.
-
-
Case 2: if
, thus
.
In the first case,
: the least residue of
is positive. In the second case
: the least residue of
is negative.
Let
be the number of negative least residues of the integer
. We know from Gauss’ Lemma that
. As
is also the number of
such that
,
If
,
. For
,
so
and
.
If
,
.
thus
and
.
If
,
.
thus
and
.
If
,
,
thus
and
. □