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.
Table of ContentsNumbers.- Numbers.- Induction.- Euclid's Algorithm.- Unique Factorization.- Congruence.- Congruence classes and rings.- Congruence Classes.- Rings and Fields.- Matrices and Codes.- Congruences and Groups.- Fermat's and Euler's Theorems.- Applications of Euler's Theorem.- Groups.- The Chinese Remainder Theorem.- Polynomials.- Polynomials.- Unique Factorization.- The Fundamental Theorem of Algebra.- Polynomials in ?[x].- Congruences and the Chinese Remainder Theorem.- Fast Polynomial Multiplication.- Primitive Roots.- Cyclic Groups and Cryptography.- Carmichael Numbers.- Quadratic Reciprocity.- Quadratic Applications.- Finite Fields.- Congruence Classes Modulo a Polynomial.- Homomorphisms and Finite Fields.- BCH Codes.- Factoring Polynomials.- Factoring in ?[x].- Irreducible Polynomials.