Read more
This is a book for an undergraduate number theory course, senior thesis work, graduate level study, or for those wishing to learn about applications of number theory to data encryption and security. With no abstract algebra background required, it covers congruences, the Euclidean algorithm, linear Diophantine equations, the Chinese Remainder Theorem, Mobius inversion formula, Pythagorean triplets, perfect numbers and amicable pairs, Law of Quadratic Reciprocity, theorems on sums of squares, Farey fractions, periodic continued fractions, best rational approximations, and Pell's equation. Results are applied to factoring and primality testing including those for Mersenne and Fermat primes, probabilistic primality tests, Pollard's rho and p-1 factorization algorithms, and others. Also an introduction to cryptology with a full discussion of the RSA algorithm, discrete logarithms, and digital signatures.
Chapters on analytic number theory including the Riemann zeta function, average orders of the lattice and divisor functions, Chebyshev's theorems, and Bertrand's Postulate. A chapter introduces additive number theory with discussion of Waring's Problem, the pentagonal number theorem for partitions, and Schnirelmann density.
About the author
Peter D. Schumer is the John C. Baldwin Professor of Mathematics and Natural Philosophy at Middlebury College. He received his B.S and M.S. degrees from Rensselaer Polytechnic Institute and his Ph.D. from University of Maryland. He has held research and teaching positions at UC Berkeley, Stanford, UC San Diego, San Jose State U, and at Doshisha U, Keio U, and ICU in Japan. His main areas of interest are number theory and the history of mathematics. His courses vary from calculus, linear algebra, and the mathematics of games and puzzles to combinatorics, complex analysis, and advanced number theory. He has directed more than fifty senior projects and theses in related areas. His scholarly work has appeared in Mathematika, Journal of Number Theory, Math Horizons, College Mathematics Journal, and elsewhere. He has published two books, Introduction to Number Theory (PWS, 1996) and Mathematical Journeys (Wiley, 2004). His book Fractions – A Sliver of the Story will be release this year (OUP, 2024). He has also written articles for general audiences on when humans first began to count and the origins of the letter x in algebra. He is a recipient of the Trevor Evans Award from the MAA on an article about the mathematician Paul Erdos (2000). He also teaches courses on the game of go and its cultural significance and has been awarded the national Teacher of the Year award from the American Go Association (2021).
Summary
This is a book for an undergraduate number theory course, senior thesis work, graduate level study, or for those wishing to learn about applications of number theory to data encryption and security. With no abstract algebra background required, it covers congruences, the Euclidean algorithm, linear Diophantine equations, the Chinese Remainder Theorem, Mobius inversion formula, Pythagorean triplets, perfect numbers and amicable pairs, Law of Quadratic Reciprocity, theorems on sums of squares, Farey fractions, periodic continued fractions, best rational approximations, and Pell’s equation. Results are applied to factoring and primality testing including those for Mersenne and Fermat primes, probabilistic primality tests, Pollard’s rho and p-1 factorization algorithms, and others. Also an introduction to cryptology with a full discussion of the RSA algorithm, discrete logarithms, and digital signatures.
Chapters on analytic number theory including the Riemann zeta function, average orders of the lattice and divisor functions, Chebyshev’s theorems, and Bertrand’s Postulate. A chapter introduces additive number theory with discussion of Waring’s Problem, the pentagonal number theorem for partitions, and Schnirelmann density.
