Proof. Let
be a rational prime,
. As
, we know from Theorem 2, Chapter 8, that there are integers
and
such that
, and that
is uniquely determined by these conditions.
Then
have same parities. If we take
, then
, and
, so
. If
, then
. Since
, and
, then
, so
is a primary prime.
Suppose that
. Since
is odd, and
,
By Proposition 9.6.1,
Therefore
Here
is of order 3, so
. By Exercise 8.6,
where
is the Legendre’s character.
In this case,
,
, so
, and by Lemma 1 section 4, where
and
,
By Exercise 8.15,
and the Exercise 8.27(b) gives
thus
Moreover, since
, by Exercise 8.27(c),
Therefore
where
Since
,
Conversely, suppose that
. Then
. Write
. By Exercise 8.27(c),
. thus
Since
,
thus
.
By Exercise 8.6,
Here
is of order 3, therefore
, so
If
, then
. Then
. As
, we would have
. Here
, otherwise
, so
, and
, so
, and
, which is a nonsense. Therefore
, where
is a primary prime: it’s impossible. Indeed
is a unit and
is prime, so
implies that
and
are associate, in contradiction with
.
If
, then
, so
.
Reasoning modulo
, where
, we obtain
where
, so
. Since
, we obtain the same contradiction as above.
So
, and the previously proved equivalence
show that
.
Conclusion:
□