David Bressoud – författare

A Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for working with integers. Traditional topics are covered, but the text also explores factoring algorithms, primality testing, the RSA public-key cryptosystem, and unusual applications such as check digit schemes and a computation of the energy that holds a salt crystal together. Advanced topics include continued fractions, Pell’s equation, and the Gaussian primes.

In this second edition of the MAA classic, exploration continues to be an essential component. More than 60 new exercises have been added, and the chapters on Infinite Summations, Differentiability and Continuity, and Convergence of Infinite Series have been reorganized to make it easier to identify the key ideas.