This book is an informal and readable introduction to higher algebra at the post-calculus level. The concepts of ring and field are introduced through study of the familiar examples of the integers and polynomials. The new examples and theory are built in a well-motivated fashion and made relevant by many applications - to cryptography, coding, integration, history of mathematics, and especially to elementary and computational number theory. The later chapters include expositions of Rabiin's probabilistic primality test, quadratic reciprocity, and the classification of finite fields. Over 900 exercises are found throughout the book.
From the reviews: "The user-friendly exposition is appropriate for the intended audience. Exercises often appear in the text at the point they are relevant, as well as at the end of the section or chapter. Hints for selected exercises are given at the end of the book. There is sufficient material for a two-semester course and various suggestions for one-semester courses are provided. Although the overall organization remains the same in the second edition'Changes include the following: greater emphasis on finite groups, more explicit use of homomorphisms, increased use of the Chinese remainder theorem, coverage of cubic and quartic polynomial equations, and applications which use the discrete Fourier transform." MATHEMATICAL REVIEWS From the reviews of the third edition: "This book can serve as both an introduction to number theory and abstract algebra, sacrifices have to be made with respect to its algebraic content. ... the book has been written with a high degree of rigor and accuracy and I definitely recommend it for consideration as the basis of an alternative route into abstract algebra and its applications." (The Mathematical Association of America, April, 2009) "The target audience remains students requiring a substantial introduction to the elements of university-level algebra. ... the text proceeds throughout on a foundation built from the students' familiarity with integers and polynomials over fields. Great care is taken to proceed to abstract concepts by way of familiar examples, and a great many exercises are provided throughout the text. ... A noteworthy feature of the book is the inclusion of extensive material on applications, to such topics as cryptography and factoring polynomials." (Kenneth A. Brown, Mathematical Reviews, Issue 2009 i)
Preface.- Numbers.- Induction.- Euclid's Algorithm.- Unique Factorization.- Congruence.- Congruence Classes.- Rings and Fields.- Matrices and Codes.- Fermat's and Euler's Theorems.- Applications of Fermat's and Euler's Theorems.- Groups.- The Chinese Remainder Theorem.- Polynomials.- Unique Factorization.- The Fundamental Theorem of Algebra.- Polynomials in Q[x].- Congruences and the CRT.- Fast Polynomial Multiplication.- Cyclic Groups and Cryptography.- Carmichael Numbers..- Quadratic Reciprocity.- Quadratic Applications.- Congruence Classes Modulo a Polynomial.- Homomorphism and Finite Fields.- BCH Codes.- Factoring in Z[x].- Irreducible Polynomials.- Answers and Hints to the Exercises.- References.- Index.-
Series: Undergraduate Texts in Mathematics
Tertiary; University or College
Number Of Pages: 604
Published: 1st November 2008
Publisher: Springer-Verlag New York Inc.
Country of Publication: US
Dimensions (cm): 23.5 x 15.5
Weight (kg): 1.02
Edition Number: 3
Edition Type: Revised