Hunter Patton

MATH 584 Section 33 Exercises

4/15/16

Exercise 9. Let Z2 be an algebraic closure of Z2 , and let , Z2 be zeros of x3 + x2 + 1 and x3 + x + 1,

respectively. Using the results of this section, show that Z2 () = Z2 ().
Proof. We see that both x3 + x2 + 1 and x3 + x + 1 are irreducible over Z2 because by plugging in 0 and 1
into both polynomials, we do not get 0. So, we see that Z2 () and Z2 () are both simple extensions of Z2
of degree 3. Thus, Z2 () and Z2 () are subfields of Z2 , and they both contain 8 elements. Theorem 33.3
then tells us that the zeros of Z2 () and Z2 () are precisely the zeros in Z2 of x8 x. Therefore, these fields
must be the same, i.e. Z2 () = Z2 ().
Exercise 14. Let p be an odd prime.
a. Show that a Z, were a 6 0(mod p), the congruence x2 a(mod p) has a solution in Z iff a(p1)/2
1(mod p).
b. Using part (a), determine whether or not the polynomial x2 6 is irreducible in Z17 [x].
Proof.
a. ()
Assume that the congruence x2 a(mod p) has a solution in Z. So, the square root of a is an integer.
Taking the square root in the congruence x2 a(mod p), we have x a1/2 (mod p). Raising both
sides to the (p 1)th power, we have xp1 a(p1)/2 (mod p). By Fermats Little Theorem, we have
xp1 1 a(p1)/2 (mod p).
()
Let a(p1)/2 1(mod p), for a Z and a 6 0(mod p). We want to show the the congruence
x2 a(mod p) has a solution in Z. We have following:
1 a(p1)/2 (mod p)
xp1 a(p1)/2 (mod p)

By Fermats Little Theorem, for any indeterminate x

x a1/2 (mod p)
x2 a(mod p)

Therefore, x2 a(mod p) has a solution in Z.

b. To see if x2 6 is irreducible in Z17 [x], we have to check if 6(171)/2 = 68 is equivalent to 1 modulo 17.
68 (62 )4 24 16(mod 17)
which is not equivalent to 1 modulo 17. Therefore, by (a), x2 6 is irreducible in Z17 [x].