Enhanced descriptions from Syndetics:

An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage.

New to the Second Edition

*nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp; Removal of all advanced material to be even more accessible in scope

*nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp; New fundamental material, including partition theory, generating functions, and combinatorial number theory

*nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp; Expanded coverage of random number generation, Diophantine analysis, and additive number theory

*nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp; More applications to cryptography, primality testing, and factoring

*nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp; An appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing

Taking a truly elementary approach to number theory, this text supplies the essential material for a first course on the subject. Placed in highlighted boxes to reduce distraction from the main text, nearly 70 biographies focus on major contributors to the field. The presentation of over 1,300 entries in the index maximizes cross-referencing so students can find data with ease.

Table of contents provided by Syndetics

• Preface (p. ix)
• 1 Arithmetic of the Integers (p. 1)
• 1.1 Induction (p. 1)
• 1.2 Division (p. 16)
• 1.3 Primes (p. 30)
• 1.4 The Chinese Remainder Theorem (p. 40)
• 1.5 Thue's Theorem (p. 44)
• 1.6 Combinatorial Number Theory (p. 49)
• 1.7 Partitions and Generating Functions (p. 55)
• 1.8 True Primality Tests (p. 60)
• 1.9 Distribution of Primes (p. 65)
• 2 Modular Arithmetic (p. 73)
• 2.1 Basic Properties (p. 73)
• 2.2 Modular Perspective (p. 84)
• 2.3 Arithmetic Functions: Euler, Carmichael, and Mobius (p. 90)
• 2.4 Number and Sums of Divisors (p. 102)
• 2.5 The Floor and the Ceiling (p. 108)
• 2.6 Polynomial Congruences (p. 113)
• 2.7 Primality Testing (p. 119)
• 2.8 Cryptology (p. 127)
• 3 Primitive Roots (p. 139)
• 3.1 Order (p. 139)
• 3.2 Existence (p. 145)
• 3.3 Indices (p. 153)
• 3.4 Random Number Generation (p. 160)
• 3.5 Public-Key Cryptography (p. 166)
• 4 Quadratic Residues (p. 177)
• 4.1 The Legendre Symbol (p. 177)
• 4.2 The Quadratic Reciprocity Law (p. 189)
• 4.3 Factoring (p. 201)
• 5 Simple Continued Fractions and Diophantine Approximation (p. 209)
• 5.1 Infinite Simple Continued Fractions (p. 209)
• 5.2 Periodic Simple Continued Fractions (p. 221)
• 5.3 Pell's Equation and Surds (p. 232)
• 5.4 Continued Fractions and Factoring (p. 240)
• 6 Additivity - Sums of Powers (p. 243)
• 6.1 Sums of Two Squares (p. 243)
• 6.2 Sums of Three Squares (p. 252)
• 6.3 Sums of Four Squares (p. 254)
• 6.4 Sums of Cubes (p. 259)
• 7 Diophantine Equations (p. 265)
• 7.1 Norm-Form Equations (p. 265)
• 7.2 The Equation ax[superscript 2] + by[superscript 2] + cz[superscript 2] = 0 (p. 274)
• 7.3 Bachet's Equation (p. 277)
• 7.4 Fermat's Last Theorem (p. 281)
• Appendix A Fundamental Facts (p. 285)
• Appendix B Complexity (p. 311)
• Appendix C Primes [characters not reproducible] 9547 and Least Primitive Roots (p. 313)
• Appendix D Indices (p. 318)
• Appendix E The ABC Conjecture (p. 319)
• Appendix F Primes is in P (p. 320)
• Solutions to Odd-Numbered Exercises (p. 323)
• Bibliography (p. 351)
• List of Symbols (p. 355)
• Index (p. 356)
• About the Author (p. 369)

Reviews provided by Syndetics

CHOICE Review

The statement known generally as "Fermat's last theorem" (but more accurately described as Fermat's conjecture) stood as mathematics' most celebrated challenge until its proof in 1994 by Andrew Wiles (assisted by Richard Taylor), building on previous work of Shimura, Langlands, Tunnell, Frey, Serre, Ribet, Mazur, and others. Intense interest surrounding this event spawned a flurry of publication, tempered only by the ferocious complexity of the ideas involved. Popular but shallow treatments have come from A. Aczel and S. Singh (but avoid M. Vos Savant's wrongheaded and worthless diatribe!); however, A.J. Van Der Poorten's semitechnical account well suits undergraduates. The serious reader pursuing the necessary background for penetrating Wiles's work absolutely must turn to the volume reviewed here edited by Cornell, Silverman, and Stevens (based on a 1995 Boston University conference), with contributions by many of the best respected number theorists of our day. Though one should expect no comparable volume anytime soon, libraries should also acquire Current Developments in Mathematics for 1995 for the worthy 154-page article by H. Darmon, F. Diamond, and R. Taylor, and also the premature publications (assembled prior to full access to Wiles's manuscript) Seminar on Fermat's Last Theorem: 1993-1994, ed. by V. Kumar Murty (1995), and Elliptic Curves, Modular Forms, & Fermat's Last Theorem, ed. by John Coates and S.T. Yau (CH, Feb'96). Although most undergraduates can only hope to admire from afar the details in these books, the great importance and even glamour of the work therein make these volumes essential for college libraries. Elliptic curves in various guises have received close scrutiny from mathematicians for more than 200 years, but the vital if auxiliary role they play in Wiles's proof of Fermat's Last Theorem only intensifies their centrality in modern mathematics. Worthy expositions abound, especially those of Cassels, Husemuller, Knapp, Koblitz, Silverman, and Tate-Silverman. A shade more elementary than most of these, undergraduates will find that McKean and Moll's book also offers more diverse viewpoints, describing connections to dynamical systems, solitons, elliptic integrals, and theta functions, as well as Diophantine problems. Chapter 5, "Ikosaeder and the Quintic," by itself deserves comparison with two recent books, Geometry of the Quintic, by J. Shurman (CH, Oct'97) and Beyond the Quartic Equation, by R.B. King (1996). Chapter 6 describes the almost magical properties of the j-function as it relates to extensions of imaginary quadratic fields, a theory with famous elementary consequences but rarely exposited. Highly recommended. Mollin advertises his book as structured for undergraduate number theory courses at any level. To this end he places two optional sections at the end of each chapter, one pitched to computer science students, usually emphasizing cryptography, and another to upper-division undergraduate students concerning the algebraic theory of quadratic fields. A look in chapter 5 at his treatment of continued fractions illustrates the difficulty of serving upper- and lower-division undergraduates simultaneously, as well as some of the book's other weaknesses. The lower-division student finds very formal prose, few applications, proofs that depend on exercises, and no diagrams such as those that enliven, say, the classic by C. Olds (Continued Fractions, 1963); the upper-division students will not see how linear algebra clarifies the basic continued fraction formalism. Moreover, "mandatory" material in this chapter concerning periodic continued fractions depends on the difficult definition of discriminant tucked in an optional section of chapter 2. Finally, the proof here of Lagrange's key theorem on the periodicity of continued fraction expansions of quadratic irrationalities seems to stop short of the desired conclusion. The book's strengths lie in its currency, its many worked examples, the historical footnotes, and the references to the literature. D. V. Feldman University of New Hampshire

Author notes provided by Syndetics

Richard A. Mollin, Ph.D., is a professor in the mathematics department at the University of Calgary, Alberta, Canada