Bressoud D., Wagon S. A Course in Computational Number Theory

John Wiley & Sons, 2000. — xii, 370 p. — ISBN 978-0-470-41215-2.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.Notation
Fundamentals
Congruences, Equations, and Powers
Euler's φ Function
Prime Numbers
Some Applications
Quadratic Residues
Continued Fractions
Prime Testing with Lucas Sequences
Prime Imaginaries and Imaginary Primes
Mathematics Basics
Lucas Certificates ExistIndex of Mathematics Objects
Subject IndexФайл: отскан. стр. (b/w 300 dpi) + OCR