- •List of Symbols
- •Classical Algebra
- •Modern Algebra
- •Binary Operations
- •Algebraic Structures
- •Extending Number Systems
- •Algebra of Sets
- •Number of Elements in a Set
- •Boolean Algebras
- •Propositional Logic
- •Switching Circuits
- •Divisors
- •Posets and Lattices
- •Normal Forms and Simplification of Circuits
- •Transistor Gates
- •Representation Theorem
- •Exercises
- •Groups and Symmetries
- •Subgroups
- •Cyclic Groups and Dihedral Groups
- •Morphisms
- •Permutation Groups
- •Even and Odd Permutations
- •Equivalence Relations
- •Normal Subgroups and Quotient Groups
- •Morphism Theorem
- •Direct Products
- •Groups of Low Order
- •Action of a Group on a Set
- •Exercises
- •Translations and the Euclidean Group
- •Matrix Groups
- •Finite Groups in Two Dimensions
- •Proper Rotations of Regular Solids
- •Finite Rotation Groups in Three Dimensions
- •Necklace Problems
- •Coloring Polyhedra
- •Counting Switching Circuits
- •Exercises
- •Monoids and Semigroups
- •Finite-State Machines
- •Quotient Monoids and the Monoid of a Machine
- •Exercises
- •Rings
- •Integral Domains and Fields
- •Subrings and Morphisms of Rings
- •New Rings From Old
- •Field of Fractions
- •Convolution Fractions
- •Exercises
- •Euclidean Rings
- •Euclidean Algorithm
- •Unique Factorization
- •Factoring Real and Complex Polynomials
- •Factoring Rational and Integral Polynomials
- •Factoring Polynomials over Finite Fields
- •Linear Congruences and the Chinese Remainder Theorem
- •Exercises
- •Ideals and Quotient Rings
- •Computations in Quotient Rings
- •Morphism Theorem
- •Quotient Polynomial Rings that are Fields
- •Exercises
- •Field Extensions
- •Algebraic Numbers
- •Galois Fields
- •Primitive Elements
- •Exercises
- •Latin Squares
- •Orthogonal Latin Squares
- •Finite Geometries
- •Magic Squares
- •Exercises
- •Constructible Numbers
- •Duplicating a Cube
- •Trisecting an Angle
- •Squaring the Circle
- •Constructing Regular Polygons
- •Nonconstructible Number of Degree 4
- •Exercises
- •The Coding Problem
- •Simple Codes
- •Polynomial Representation
- •Matrix Representation
- •Error Correcting and Decoding
- •BCH Codes
- •Exercises
- •Induction
- •Divisors
- •Prime Factorization
- •Proofs in Mathematics
- •Modern Algebra in General
- •History of Modern Algebra
- •Connections to Computer Science and Combinatorics
- •Groups and Symmetry
- •Rings and Fields
- •Convolution Fractions
- •Latin Squares
- •Geometrical Constructions
- •Coding Theory
- •Chapter 2
- •Chapter 3
- •Chapter 4
- •Chapter 5
- •Chapter 6
- •Chapter 7
- •Chapter 8
- •Chapter 9
- •Chapter 10
- •Chapter 11
- •Chapter 12
- •Chapter 13
- •Chapter 14
- •Index
314 |
|
|
|
|
|
|
|
ANSWERS TO THE ODD-NUMBERED EXERCISES |
||||||||||
7.39. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
[ ] |
[α] |
|
[β] |
[γ ] |
[αβ] |
|
[αγ ] |
|
|
|
|||||
|
|
|
|
|
|
|
|
|||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
[ ] |
|
|
[ ] |
[α] |
|
[β] |
[γ ] |
[αβ] |
|
[αγ ] |
|
|
|
|||||
|
[α] |
|
[α] |
[ ] |
[αβ] |
[αγ ] |
[β] |
|
[γ ] |
|
|
|
||||||
|
[β] |
|
[β] |
[β] |
[β] |
[γ ] |
[β] |
|
[γ ] |
|
|
|
||||||
|
[γ ] |
|
[γ ] |
[γ ] |
[γ ] |
[β] |
[γ ] |
|
[β] |
|
|
|
||||||
|
[αβ] |
|
[αβ] |
[αβ] |
[αβ] |
[αγ ] |
[αβ] |
|
[αγ ] |
|
|
|
||||||
|
[αγ ] |
|
[αγ ] |
[αγ ] |
[αγ ] |
[αβ] |
[αγ ] |
|
[αβ] |
|
|
|
||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
7.41. |
s0 |
|
|
|
0 |
|
s1 |
|
7.43. |
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0 |
|
|
||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||
0, 1 |
|
|
|
1 |
|
|
|
|
s00 |
|
s01 |
|||||||
|
|
|
|
|
|
|
|
|
||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
|
|
1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0 |
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
s11 |
|
s10 |
||||
|
|
|
|
|
|
|
|
|
|
|
1 |
|
|
|
|
1 |
{[0], [1]}. {[0], [1], [10]}. 7.45. The monoid contains 27 elements.
|
|
CF |
|
|
|
Dormant R |
Dormant W |
Dormant W |
Buds |
F |
Dead |
1 |
2 |
3 |
|
|
|
|
CF |
|
|
|
|
WCF |
R |
R |
RWC |
|
RWCF |
CHAPTER 8 |
|
|
|
|
|
|
|
|
|
||
8.1. |
|
|
|
|
|
|
|
|
|
|
|
+ |
0 |
1 |
2 |
3 |
· |
0 |
1 |
2 |
3 |
||
|
0 |
0 |
1 |
2 |
3 |
|
0 |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
3 |
0 |
|
1 |
0 |
1 |
2 |
3 |
|
2 |
2 |
3 |
0 |
1 |
|
2 |
0 |
2 |
0 |
2 |
|
3 |
3 |
0 |
1 |
2 |
|
3 |
0 |
3 |
2 |
1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
8.3. A ring.
8.5. Not a ring; not closed under multiplication. 8.7. Not a ring; not closed under addition.
8.9. A ring.
8.11. Not a ring; distributive laws do not hold. 8.17. A subring.
8.19. Not a subring; not closed under addition.
8.21. |
Neither. |
8.23. |
Both. |
8.25. |
Integral domain. |
8.29. |
[2], [4], [5], [6], [8]. |
ANSWERS TO THE ODD-NUMBERED EXERCISES |
315 |
8.31. Any nonempty proper subset of X. 8.33. Nonzero matrices with zero determinant.
8.37. f (x) = [x]6.
8.39. f (x, y) = (x, y), (y, x), (x, x) or (y, y).
8.47. (b) −1 and 0.
8.55.The identity is Dn(x) = (1/2π ) + (1/π )(cos x + cos 2x + · · · + cos nx). The ring is not an integral domain.
CHAPTER 9
9.1. |
23 x2 + 45 x − 158 and 458 x + 87 . |
|
|
|
|
|
|
|
|
|
|
||||||
9.3. |
x4 + x3 + x2 + x and 1. |
and 1 − 2i, or 4 − 2i |
and −3 + i. |
|
|
|
|||||||||||
9.5. |
3 − i and 4 + 2i, or 4 − i |
|
|
|
|||||||||||||
9.7. gcd(a, b) = 3, s = −5, t = 4. |
|
|
|
|
|
|
|
|
|
|
|||||||
9.9. gcd(a, b) = 1, s = −(2x + 1)/3, t = (2x + 2)/3. |
|
|
|
|
|
|
|
||||||||||
9.11. gcd(a, b) = 2x + 1, s = 1, t = 2x + 1. |
|
|
|
|
|
|
|
|
|
|
|||||||
9.13. gcd(a, b) = 1, s = 1, t = −1 + 2i. |
|
|
|
|
|
|
|
|
|
|
|||||||
9.15. x = −6, y = 5. |
9.17. x = −14, y = 5. |
|
|
|
|
||||||||||||
9.19. [23]. |
|
|
|
9.21. [17]. |
)(x4 |
|
x3 |
|
x2 |
|
|
|
|||||
9.23. |
No solutions. |
9.25. (x |
− 1 |
+ |
+ |
+ |
x |
) |
|||||||||
(x |
2 |
+ |
2)(x |
2 |
+ 3). |
9.29. x |
4 |
|
|
|
|
+ 1 . |
|||||
9.27. |
|
|
|
− 9x + 3. |
|
|
|
|
|
|
|||||||
|
3 − |
+ |
|
|
|
|
|
|
|
|
|
|
|
|
|
9.33.(x − √2)(x + √2)(x − i√2)(x + i√2)(x − 1 − i)(x − 1 + i) (x + 1 − i)(x + 1 + i).9.31. x 4x 1.
9.35. (x2 − 2)(x2 + 2)(x2 − 2x + 2)(x2 + 2x + 2). |
+ |
|
+ |
|
+ |
|
|
+ |
|
+ |
|
||||||||||||||||||||
9.37. |
5 |
+ |
|
4 |
+ 1,2 |
x5 |
+ |
x2 |
+ 5 |
x5 |
3+ |
x4 |
2+ |
x3 |
+ |
x2 |
1, x5 |
x4 |
x3 |
|
1, |
||||||||||
x5 |
|
x |
3 |
|
|
|
|
|
1, |
|
|
|
|
|
|
|
x |
|
|||||||||||||
|
x + x + x + x + 1, x + x + x + x + 1. |
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||||
9.39. x3 |
+ 2. |
|
|
|
|
|
2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
√ |
|
|
|
|
|
|
||||
9.41. Kerψ = {q(x) · |
(x |
|
|
− 2x + 4)|q(x) Q[x]} and Im ψ |
= Q( |
3 |
i) = |
|
|
||||||||||||||||||||||
|
|
|
√ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
{a + b 3i|a, b Q}. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||
9.43. Irreducible by Eisenstein’s Criterion. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||
9.45. Irreducible, since it has no linear factors. |
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||||
9.47. Reducible; any polynomial of degree >2 in R[x] is reducible. |
|
|
|
|
|
|
|||||||||||||||||||||||||
9.49. No. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
9.55. No. |
|
|
|
|
|
|
|
|
|
|
|
|||||
9.61. x ≡ 40 mod 42. |
|
|
|
|
|
|
|
|
9.63. x ≡ 22 mod 30. |
|
|
|
|
|
|
|
|||||||||||||||
9.67. |
65. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
CHAPTER 10
10.1. ((0, 0)), ((0, 1)), ((1, 0)), Z2 × Z2. 10.3. (0) and Q.
316 |
ANSWERS TO THE ODD-NUMBERED EXERCISES |
10.5. (p(x)) where p(x) C[x].
10.7. The quotient ring is a field.
+ |
(3) |
|
(3) + 1 |
(3) + 2 |
||
(3) |
(3) |
|
(3) + 1 |
(3) + 2 |
||
(3) + 1 |
(3) + 1 |
(3) + 2 |
(3) |
|||
(3) + 2 |
(3) + 2 |
(3) |
|
(3) + 1 |
||
|
|
|
|
|
||
· |
(3) |
(3) + 1 |
(3) + 2 |
|||
(3) |
(3) |
(3) |
|
(3) |
|
|
(3) + 1 |
(3) |
(3) + 1 |
(3) + 2 |
|||
(3) + 2 |
(3) |
(3) + 2 |
(3) + 1 |
|||
|
|
|
|
|
|
|
10.9. The ideal ((1, 2)) is the whole ring Z3 × Z3. The quotient ring is not a field.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
+ |
|
|
|
((1, 2)) |
|
|
· |
((1, 2)) |
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
((1, 2)) |
((1, 2)) |
|
|
|
|
|
|
|
((1, 2)) |
|
|
((1, 2)) |
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
|||||
10.11. 8x + 2 and 14x + 97. |
10.13. x2 + x and x2. |
|
|
|
|
|
|
|||||||||
10.17. (a) 6; (b) 36; (c) x2 − 1, (a) ∩ (b) = (lcm(a, b)). |
|
|
|
|
|
|
||||||||||
10.33. No. |
|
|
|
|
|
10.35. The whole ring. |
|
|
|
|||||||
10.37. |
|
|
|
|
|
|
Z8 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
([2]8) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
([4]8) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
([0]8) |
|
|
|
|
|
|
|
|
|
10.39. Irreducible; Z11. |
|
|
|
|
10.41. Reducible. |
√ |
|
|
|
|
|
|||||
|
|
√ |
|
|
|
|
|
|
|
|
|
|
√ |
|
|
|
10.43. Irreducible; Q( |
4 |
2). |
|
|
10.45. Irreducible; Q( 2, |
3). |
||||||||||
|
|
|
||||||||||||||
10.47. Not a field; contains zero divisors. |
|
|
|
|
|
|
|
|
||||||||
10.49. A field by Corollary 10.16. |
10.51. A field by Theorem 10.17. |
10.53. |
Not a field; x2 + 1 = (x + 2)(x + 3) in Z5[x]. |
10.55. |
A field isomorphic to Q[x]/(x4 − 11). |
10.59. |
(0) and (xn) for n 0; (x) is maximal. |
ANSWERS TO THE ODD-NUMBERED EXERCISES |
317 |
CHAPTER 11
11.1. GF(5) = Z5 = {0, 1, 2, 3, 4}.
+ |
|
0 |
1 |
2 |
3 |
4 |
0 |
|
0 |
1 |
2 |
3 |
4 |
1 |
|
1 |
2 |
3 |
4 |
0 |
2 |
|
2 |
3 |
4 |
0 |
1 |
3 |
|
3 |
4 |
0 |
1 |
2 |
4 |
|
4 |
0 |
1 |
2 |
3 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
· |
|
0 |
1 |
2 |
3 |
4 |
0 |
|
0 |
0 |
0 |
0 |
0 |
1 |
|
0 |
1 |
2 |
3 |
4 |
2 |
|
0 |
2 |
4 |
1 |
3 |
3 |
|
0 |
3 |
1 |
4 |
2 |
4 |
|
0 |
4 |
3 |
2 |
1 |
|
|
|
|
|
|
|
11.3. |
GF(9) = Z3[x]/(x2 + 1) = {aα + b|a, b Z3, α2 + 1 = 0}. |
|
|
|||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
||||
+ |
0 |
1 |
2 |
|
α |
|
α + 1 |
α + 2 |
2α |
|
2α + 1 2α + 2 |
|||||
0 |
0 |
1 |
|
2 |
α |
|
α + 1 |
α + 2 |
2α |
|
2α + 1 2α + 2 |
|||||
1 |
1 |
2 |
|
0 |
α + 1 |
α + 2 |
α |
|
2α + 1 2α + 2 2α |
|||||||
2 |
2 |
0 |
|
1 |
α + 2 |
α |
|
α + 1 |
2α + 2 2α |
|
2α + 1 |
|||||
α |
|
α |
α + 1 |
α + 2 2α |
|
2α + 1 |
2α + 2 |
|
0 |
|
1 |
2 |
||||
α + 1 |
|
α + 1 |
α + 2 |
α |
|
2α + 1 2α + 2 |
2α |
|
|
1 |
|
2 |
0 |
|||
α + 2 |
|
α + 2 |
α |
α + 1 2α + 2 2α |
|
2α + 1 |
|
2 |
|
0 |
1 |
|||||
2α |
|
2α |
2α + 1 2α + 2 |
|
0 |
|
1 |
|
2 |
α |
|
α + 1 |
α + 2 |
|||
2α + 1 |
|
2α + 1 2α + 2 2α |
|
|
1 |
|
2 |
|
0 |
α + 1 |
α + 2 |
α |
||||
2α + 2 |
|
2α + 2 2α |
2α + 1 |
|
2 |
|
0 |
|
1 |
α + 2 |
α |
|
α + 1 |
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
· |
|
0 |
1 |
2 |
|
α |
|
α + 1 |
α + 2 |
2α |
|
2α + 1 |
2α + 2 |
|||
0 |
|
0 |
0 |
0 |
|
0 |
|
0 |
|
0 |
|
0 |
|
0 |
|
0 |
1 |
|
0 |
1 |
2 |
|
α |
|
α + 1 |
|
α + 2 |
2α |
|
2α + 1 |
2α + 2 |
||
2 |
|
0 |
2 |
1 |
2α |
|
2α + 2 |
2α + 1 |
|
α |
|
α + 2 |
|
α + 1 |
||
α |
|
0 |
α |
2α |
|
2 |
|
α + 2 |
2α + 2 |
|
1 |
|
α + 1 |
2α + 1 |
||
α + 1 |
|
0 |
α + 1 2α + 2 |
|
α + 2 |
2α |
|
1 |
2α + 1 |
|
2 |
|
α |
|||
α + 2 |
|
0 |
α + 2 2α + 1 |
2α + 2 |
|
1 |
|
α |
|
α + 1 |
2α |
|
2 |
|||
2α |
|
0 |
2α |
α |
|
1 |
2α + 1 |
|
α + 1 |
|
2 |
2α + 2 |
|
α + 2 |
||
2α + 1 |
|
0 |
2α + 1 |
α + 2 |
|
α + 1 |
|
2 |
2α |
2α + 2 |
|
α |
|
1 |
||
2α + 2 |
|
0 |
2α + 2 |
α + 1 |
2α + 1 |
|
α |
|
2 |
|
α + 2 |
|
1 |
2α |
11.5. |
x3 |
+ |
x |
+ 4. |
11.7. |
Impossible. |
|||||
|
2 |
|
|
4 |
− 16x |
2 |
+ 16. |
||||
11.9. |
x |
|
6+ |
2. |
|
11.11. |
x |
|
|
||
11.13. |
8x |
− 9. |
11.17. |
3. |
|
|
|