Publisher:

Princeton University Press

Number of Pages:

503

Price:

49.50

ISBN:

0-691-12060-9

Don’t let the friendly word “invitation” in the title fool you. This is a great book, but not one for the mathematically faint of heart. The book grew from undergraduate research seminars at

The eighteen chapters of this book are divided into five parts: Part 1 is devoted to basic number theory (including cryptography, the Riemann zeta function, some complex function theory, Dirichlet characters, and *L*-functions); Part 2 deals with approximating numbers with rationals (including a proof of Roth’s Theorem on the approximation of real algebraic numbers and a treatment of continued fractions); Part 3 covers probabilistic methods and equidistribution (including hypothesis testing and Fourier analysis); Part 4 describes the Circle Method and some of its applications, especially the distribution of Germain primes (*p* such that both *p* and (*p* – 1)/2 are prime); Part 5 investigates random matrix theory and *L*-functions. There are two appendices reviewing key ideas in analysis and linear algebra. Two additional appendices contain hints/comments on the exercises and “Concluding Remarks.” There is a twenty-page Bibliography containing books, published papers, preprints, and course notes. At the beginning of the Bibliography, a URL is given which provides links to many of the references. The Index is very helpful and includes an entry for “techniques” (absolute value squared, …, Method of Descent, …, Poisson Summation, …,weighted prime sums). The authors suggest that “a typical semester class would cover material from one part of the book (as well as whatever background material is needed)” — assuming some familiarity with the contents of Part 1.

Typically in this book, a topic is introduced briefly, usually with motivational and/or historical comments and references to deeper treatments. There are frequent exercises integrated into the text, and “Research Projects” are spread throughout. For example, on p. 15, after a brief introduction to congruences, the reader is asked to prove the Chinese Remainder Theorem as an exercise. The first research project, on pages 18–19, asks for investigations of the spacings between adjacent *n* such that for all positive integers *a*, *a* to the power *n* – 1 is congruent to 1 mod *n*). To me the last part of this book was the least familiar and most illustrative of the philosophy of the entire book. This spirit of exploration and interconnectivity is captured in the following remark: “In some sense, the zeros of *L*-functions behave like the eigenvalues of matrices which in turn behave like the energy levels of heavy nuclei.”

Although I can’t agree that this book is “accessible to beginning undergraduates,” as the back cover blurb states, I do claim that it is a fine book for talented and mathematically mature undergraduates, for graduate students, and for anyone looking for information on modern number theory.

Henry Ricardo (henry@mec.cuny.edu) is Professor of Mathematics at Medgar Evers College of The City University of New York and Secretary of the Metropolitan NY Section of the MAA. His book, A Modern Introduction to Differential Equations, was published by Houghton Mifflin in January, 2002; and he is currently writing a linear algebra text.

Date Received:

Saturday, March 25, 2006

Reviewable:

Yes

Publication Date:

2006

Format:

Hardcover

Audience:

Category:

Textbook

Henry Ricardo

08/18/2006

Foreword xi

Preface xiii

Notation xix

PART 1. BASIC NUMBER THEORY 1

Chapter 1. Mod p Arithmetic, Group Theory and Cryptography 3

Chapter 2. Arithmetic Functions 29

Chapter 3. Zeta and L-Functions 47

Chapter 4. Solutions to Diophantine Equations 81

PART 2. CONTINUED FRACTIONS AND APPROXIMATIONS 107

Chapter 5. Algebraic and Transcendental Numbers 109

Chapter 6. The Proof of Roth's Theorem 137

Chapter 7. Introduction to Continued Fractions 158

PART 3. PROBABILISTIC METHODS AND EQUIDISTRIBUTION 189

Chapter 8. Introduction to Probability 191

Chapter 9. Applications of Probability: Benford's Law and Hypothesis Testing 216

Chapter 10. Distribution of Digits of Continued Fractions 231

Chapter 11. Introduction to Fourier Analysis 255

Chapter 12. f n k g and Poissonian Behavior 278

PART 4. THE CIRCLE METHOD 301

Chapter 13. Introduction to the Circle Method 303

Chapter 14. Circle Method: Heuristics for Germain Primes 326

PART 5. RANDOM MATRIX THEORY AND L-FUNCTIONS 357

Chapter 15. From Nuclear Physics to L-Functions 359

Chapter 16. Random Matrix Theory: Eigenvalue Densities 391

Chapter 17. Random Matrix Theory: Spacings between Adjacent Eigenvalues 405

Chapter 18. The Explicit Formula and Density Conjectures 421

Appendix A. Analysis Review 439

Appendix B. Linear Algebra Review 455

Appendix C. Hints and Remarks on the Exercises 463

Appendix D. Concluding Remarks 475

Bibliography 476

Index 497

Publish Book:

Modify Date:

Friday, August 18, 2006

- Log in to post comments