Summary and Info
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.
More About the Author
David Marius Bressoud (born March 27, 1950 in Bethlehem, Pennsylvania) is an American mathematician who works in number theory, combinatorics, and special functions.
Review and Comments
Rate the Book
A Course in Computational Number Theory 0 out of 5 stars based on 0 ratings.