Proof. Let
be an odd prime number,
and
.
(As
, so
.)
Let
Since
defined by
is a bijection,
Therefore
. Moreover,
, since
is a bijection in
, thus
, and consequently
Thus
.
Let
be the number of negative factors in this product.
If
, then
.
Let
be the number of integers
such that the least remainder of
is negative. Since
, these
are the integers such that
, and since
, such that
, so
. Therefore
□