Primes and Programming (Paperback)

~ Peter J. Giblin (Author) "This book has for its theme the identification of prime numbers and the factorization of numbers known to be composite..." (more)
Key Phrases: covering congruences, exponentiation ciphers, strong pseudoprime, Proof Let, Project Write, Proposition Suppose (more...)

Editorial Reviews

Review

"An interesting, sophisticated introduction to number theory..." American Mathematical Monthly

"Of the many volumes I have seen about `number theory and computing', this delightful, if unorthodox, introductory text is probably the finest...a great strength of this book is its emphasis on computing and on computing examples. There are several programs included in the text, often different algorithms for achieving the same computational result, and both theoretical and practical reasons for preferring one method over another are discussed. The programming language is Pascal, which is perfectly appropriate...[and] there are a great many numerial exercises and examples...only the deadest of students could possibly consider this dry; the author has brought life and energy to the subject by his presentation." Duncan Buell, Mathematical Reviews

Product Description

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 exercises and projects, in addition to more usual theory exercises. The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely "recreational" nature.

See all Editorial Reviews

Product Details

• Paperback: 252 pages
• Publisher: Cambridge University Press (September 24, 1993)
• Language: English
• ISBN-10: 0521409888
• ISBN-13: 978-0521409889
• Product Dimensions: 9 x 5.8 x 0.7 inches
• Shipping Weight: 14.1 ounces (View shipping rates and policies)
• Average Customer Review: 3.7 out of 5 stars  See all reviews (3 customer reviews)
• Amazon.com Sales Rank: #1,485,819 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

14 of 14 people found the following review helpful:

3.0 out of 5 stars Definitely an introduction to number theory NOT algorithms., January 8, 2001

By	nimbus (Clowinfornia, USA) - See all my reviews

This is definitely an introduction, but since "introduction" is in the title of the book, you've been warned. The book is really about number theory, the programming part is very basic and much of it left to the reader/student as exercises. The programs are written in "old school" Pascal, which was the pedagogical language of choice in the pre-Internet era (I was schooled in the pre-internet era myself). This book takes little account of algorithmic efficiency (although, it does show how to get double-precision arithmetic out of Pascal). If you're looking for an approach from scratch, this is your book. If you're a mathematician looking for an emphasis on programming and algorithms get Hans Riesel's "Prime Numbers and Computer Methods for Factorization" -- a more advanced book. If you're a programmer, much of the material (and sometimes more) is also in O'Reilly's "Algorithms in...[Perl, C, C++]" in the "number theory" chapters and would make better additions to your library.

11 of 11 people found the following review helpful:

4.0 out of 5 stars A nice introduction to number theory for programmers, March 30, 2000

By	UMESH NAIR (Portland, OR, USA) - See all my reviews

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.

1 of 2 people found the following review helpful:

4.0 out of 5 stars A very instructive book. A rewarding lecture., May 27, 1999

By A Customer

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.