Primes and Programming: An Introduction to Number Theory with Computing

by Peter J. Giblin

Book Overview

Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational...

• Format: Paperback
• Language: English
• ISBN: 0521409888
• ISBN13: 9780521409889
• Release Date: September 1993
• Publisher: Cambridge University Press
• Length: 252 Pages
• Weight: 0.95 lbs.
• Dimensions: 0.6" x 5.9" x 8.9"

Customer Reviews

A nice introduction to number theory for programmers

This is a book to enjoy. Learn a great deal of Number theory and almost everything about prime numbers, including topics like cryptography. The Pascal programs are clear, and will help you to learn the theory in an enjoyable way. I would expect to have a second edition implemented in Java or C++, with additional code for multiprecision arithmetic. A great book to have, if you are new to number theory. However, if you are looking for a broader coverage, the right book is "Introduction to Number Theory with computing" by RBJT Allenby and E.J. Redfern. If you do not care computing, and want to have in-depth knowledge on Number theory, "An Introduction to Number Theory" by Hardy and Wright is the best (though it is not easy-readable!). If you want to have a short but complete introduction to Number theory, get "Higher Mathematics" by Davenport.

A very instructive book. A rewarding lecture.

The book is a practical introduction to Number Theory and the exercises are gradual and accesibles. I will be pleased if in a next edition a diskette with the programs is included.