Elementary Number Theory with Programming

This book expertly bridges the subjects of number theory and programming and features a multitude of examples and programming exercises in each chapter.  It provides an introduction to elementary number theory with fundamental coverage of computer programming and is appropriate for students of mathematics and computer science alike who need to become acquainted with the most famous theorems, problems, and concepts of number theory.  In addition, the authors provide a comprehensive presentation of the methodology and applications for readers with various levels of experience, and while theorems are provided, the authors avoid the standard theorem/proof format to aid in reader comprehension. The book features sample programs and research challenges at the end of each chapter for readers to work through, as well as an appendix that provides select answers to the chapter exercises.
The authors also maintain a supplementary material website that provides additional working examples of the computer programs. Topical coverage includes: special numbers; Fibonacci sequence, primes, and the Pell equation; Pascal's triangle; divisors and prime decomposition; modular arithmetic; number theoretic functions; Euler's Phi function; sums and partitions; and cryptography.  Prerequisites include basic algebra and some knowledge of any computer language.