A Course in Computational Number Theory

David Bressoud and Stan Wagon, 2000, Key College Publishing, 367 pp., hardbound, CD-ROM.

A Course in Computational Number Theory is an introduction to number theory, with emphasis on a broad range of computational issues. Mathematica files (on CD-ROM) with all the commands and programs are included as a tool for motivation and explanation. This book covers the theoretical structure of number theory, but expands with the software into exploration of many topics including factoring algorithms, primality testing, and the RSA public-key cryptosystem. Unusual and advanced topics also covered include check-digit schemes, continued fractions, Pell's equation, and the Gaussian primes. 

Chapters include: 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; and appendices of Mathematica Basics and Lucas Certificates Exist. 

This book is available from the Wolfram Worldwide Web Store.

[New Publications Index] [Prev Page] [Next Page]