Primes and Programming (Paperback)

Preface; 1. The fundamental theorem, GCDs and LCMs; 2. Listing primes; 3. Congruences; 4. Powers and pseudoprimes; 5. Miller's test and strong pseudoprimes; 6. Euler's theorem, orders and primality testing; 7. Cryptography; 8. Primitive roots; 9. The number of divisors d and the sum of divisors; 10. Continued fractions and factoring; 11. Quadratic residues; References; Index.