Modern Algebra: An Introduction, 6th Edition
December 2008, ©2009
I. Mappings and Operations
4 Composition as an Operation
II. Introduction to Groups
5 Definition and Examples
8 Groups and Symmetry
III. Equivalence. Congruence. Divisibility
9 Equivalence Relations
10 Congruence. The Division Algorithm
11 Integers Modulo n
12 Greatest Common Divisors. The Euclidean Algorithm
13 Factorization. Euler's Phi-Function
14 Elementary Properties
15 Generators. Direct Products
17 Lagrange's Theorem. Cyclic Groups
19 More on Isomorphism
20 Cayley's Theorem
Appendix: RSA Algorithm
V. Group Homomorphisms
21 Homomorphisms of Groups. Kernels
22 Quotient Groups
23 The Fundamental Homomorphism Theorm
VI. Introduction to Rings
24 Definition and Examples
25 Integral Domains. Subrings
27 Isomorphism. Characteristic
VII. The Familiar Number Systems
28 Ordered Integral Domains
29 The Integers
30 Field of Quotients. The Field of Rational Numbers
31 Ordered Fields. The Field of Real Numbers
32 The Field of Complex Numbers
33 Complex Roots of Unity
34 Definition and Elementary Properties
35 The Division Algorithm
36 Factorization of Polynomials
37 Unique Factorization Domains
IX. Quotient Rings
38 Homomorphisms of Rings. Ideals
39 Quotient Rings
40 Quotient Rings of F[X]
41 Factorization and Ideals
X. Galois Theory: Overview
42 Simple Extensions. Degree
43 Roots of Polynomials
44 Fundamental Theorem: Introduction
XI. Galois Theory
45 Galois Groups
46 Splitting Fields. Galois Groups
47 Separability and Normality
48 Fundamental Theorem of Galois Theory
49 Solvability by Radicals
50 Finite Fields
XII. Geometric Constructions
51 Three Famous Problems
52 Constructible Numbers
53 Impossible Constructions
XIII. Solvable and Alternating Groups
54 Isomorphis Theorems. Solvable Groups
55 Alternation Groups
XIV. Applications of Permutation Groups
56 Groups Acting on Sets
57 Burnside's Counting Theorem
58 Sylow's Theorem
59 Finite Symmetry Groups
60 Infinite Two-dimensional Symmetry Groups
61 On Crystallographic Groups
62 The Euclidean Group
XVI. Lattices and Boolean Algebras
63 Partially Ordered Sets
65 Boolean Algebras
66 Finite Boolean Algebras
C. Mathematical Induction
D. Linear Algebra
E. Solutions to Selected Problems
Photo Credit List
Index of Notation
New, brief (two section) chapter on Group Theory
Expanded treatment of Galois Theory
Material on coding theory and switching is now on accompanying website
Additional problems have been added
Durbin takes great care in helping students to understand and work with abstract ideas and proofs in a first course in modern algebra.
Each problem set is organized by level of difficulty. The early problems in each set are grouped in pairs, with solutions to odd-numbered problems in the solutions appendix.
The material is arranged so that most of the sections can be covered in one lecture.
The flexibility of the text makes it easy for professors to fit the book to their own students and course goals. The first six chapters present the core of the subject, while the subsequent chapters can be determined by individual needs.
Sections are short with many examples and explanations, so the students do not feel overwhelmed by the material.
Applications are included to help motivate students and to show the usefulness of modern algebra.
- Wiley E-Texts are powered by VitalSource technologies e-book software.
- With Wiley E-Texts you can access your e-book how and where you want to study: Online, Download and Mobile.
- Wiley e-texts are non-returnable and non-refundable.
- WileyPLUS registration codes are NOT included with the Wiley E-Text. For informationon WileyPLUS, click here .
- To learn more about Wiley e-texts, please refer to our FAQ.
- E-books are offered as e-Pubs or PDFs. To download and read them, users must install Adobe Digital Editions (ADE) on their PC.
- E-books have DRM protection on them, which means only the person who purchases and downloads the e-book can access it.
- E-books are non-returnable and non-refundable.
- To learn more about our e-books, please refer to our FAQ.