1. Factoring (2) is coveredby case (c1) of (4.3.2), andwe have (2) = (2, 1 + √ −5)2 .

Factoring (3) is coveredby case (a1), and x 2 + 5 ≡ (x + 1)(x − 1) mod3. Therefore

(3) = (3, 1 + √ −5) (3, 1 − √ −5). 2. We have (5) = (5, √ −5)2 , as in case (b). To factor
(7), note that x 2 + 5 factors mod7 as (x + 3) (x − 3), so (7) = (7, 3 + √ −5) (7, 3 − √
−5), as in case (a1). Since -5 is not a quadratic residue mod 11, we are in case (a2)
and 11 remains prime. 3. Mod5 we have x 3 −2 ≡ x 3 −27 = x 3 −3 3 = (x−3)(x 2
+3x+9) = (x+2)(x 2 +3x−1). Thus (5) = (5, α + 2)(5, α2 + 3α − 1) where α = √3 2.

1. By the Chinese remainder theorem, B/(p) ∼= i B/Pei i . If p does not ramify, then
ei = 1 for all i, so B/(p) is a product of fields, hence has no nonzero nilpotents. On
the other hand, suppose that e = ei > 1, with P = Pi . Choose x ∈ P e−1 \ P e
andobserve that (x + P e ) e is a nonzero nilpotent in B/Pe . 2. The minimal
polynomial of a nilpotent element is a power of X, andthe result follows from
(2.1.5). 3. let β = n i=1 biωi with bi ∈ Z. Then, with T denoting trace, T(A(βωj )) =
T( n i=1 biA(ωiωj )) = n i=1 biT(ωiωj ) ≡ 0 mod p.

If β /∈ (p), then not all the bi can be 0 mod p, so the determinant of the matrix
(T(ωiωj )), which is the discriminant D by (2.3.1), is 0 mod p. Therefore, p divides
d. ♣ 4. This follows from the Chinese remainder theorem, as in Problem 1. The
fields Fi all have characteristic p because p annihilates B/(p). 5. The Ti are
nondegenerate by separability, and i Ti is nondegenerate by orthogonality, that
is, πi(x)πj (y) = 0 for i = j.

6. Since Fi/Fp is a finite extension of a finite field, it is a Galois extension, so all

embeddings are actually automorphisms. Thus for any z ∈ Fi , the endomorphism
given by multiplication by z has trace TFi/Fp (z) = Ti(z). Since B/(p) is, in
particular, a direct sum of the Fi , the result follows.

1. The kernel is {a ∈ A : a/1 ∈ MS −1A} = A ∩ (MS −1A) = M by (1.2.6). 2. By

hypothesis, M ∩ S = ∅, so s /∈ M. By maximality of M we have M + As = A, so y +
bs = 1 for some y ∈ M, b ∈ A. Thus bs ≡ 1 mod M. 3. Since 1 − bs ∈ M, (a/s) − ab =
(a/s)(1 − bs) ∈ MS −1A. Therefore (a/s)+MS −1A = ab + MS −1A = h(ab).