-
(a)
-
, and
. Therefore the order of
in
is 1
, so
is a primitive root modulo
.
-
(b)
-
In Example 9.2.10, we obtained
Verification with Sage:
a = Mod(8,19)
lc = [sorted([2^j * a^i for i in range(6)]) for j in range(3)]; print(lc)
[[1, 7, 8, 11, 12, 18],
[2, 3, 5, 14, 16, 17],
[4, 6, 9, 10, 13, 15]]
By Proposition 9.2.9, with
,
If we write
, then
-
(c)
-
The similarity of these results has an explanation. If
is determined by
, then by Lemma 9.2.4(d),
and
, so
Therefore
implies
and
.
By Proposition 9.2.6 and Corollary 9.2.7,
, and so
sends
on itself. The restriction
of
to
is so a
-automorphism of
of order 3, since
. Moreover, the extension
is Galois (since
is Abelian, every subgroup of
is normal), so
thus
therefore
-
(d)
-
If we apply
to this equality, we obtain (9.15) :
It follows
We have obtained
Hence the minimal polynomial of
over
(and also of
) is
The splitting field of
is
generated by the 6-periods.
-
(e)
-
We obtain the cosets
with Sage:
b = Mod(2^6, 19)
ld = [sorted([2^j * b^i for i in range(3)]) for j in range(6)]; ld
[[1, 7, 11], [2, 3, 14], [4, 6, 9], [8, 12, 18], [5, 16, 17], [10, 13, 15]]
Since
we obtain
In Example 9.2.12, we have proved that the minimal polynomial of
and
over
is
If
is determined by
then
, so the minimal polynomial of
is
Similarly, applying
, we obtain
-
(f)
-
The extension
is an extension of degree
.
Here
(with
). Proposition 9.2.8 shows that the minimal polynomial of
over
is
Without Proposition 9.2.8, note that
, where
takes
to
, so the minimal polynomial of
over
is
As
we obtain that the minimal polynomial of
over
is