Textbook
A Course in Computational Number TheoryISBN: 978-0-470-41215-2
Hardcover
384 pages
June 2008, ©2000
This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 15-20 days delivery time. The book is not returnable.
|
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.