or
Sign in to turn on 1-Click ordering.
 
 
More Buying Choices
26 used & new from $22.20
Have one to sell? Sell yours here
 
   
Express Checkout with PayPhrase
What's this? | Create PayPhrase
Sorry!
X
Prime Numbers
 
 
See all product images
See 1 customer image
Share your own customer images
Search inside this book
Tell the Publisher!
I’d like to read this book on Kindle

Don’t have a Kindle? Get your Kindle here.
 
  

Prime Numbers (Hardcover)

~ Richard Crandall (Author), Carl Pomerance (Author)
Key Phrases: elliptic multiplication, divisor search, negacyclic convolution, Monte Carlo, Goldwasser Kilian, Toom Cook (more...)
3.8 out of 5 stars  See all reviews (4 customer reviews)
List Price: $89.95
Price: $71.97 & this item ships for FREE with Super Saver Shipping. Details
You Save: $17.98 (20%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Upgrade this book for $17.99 more, and you can read, search, and annotate every page online. See details
Usually ships within 2 to 5 weeks.
Ships from and sold by Amazon.com. Gift-wrap available.

9 new from $29.76 17 used from $22.20

Formats

Amazon Price New from Used from
  Hardcover $60.14 $44.85 $50.60
  Hardcover, May 28, 2002 $71.97 $29.76 $22.20

Frequently Bought Together

Prime Numbers + Factorization and Primality Testing (Undergraduate Texts in Mathematics) + A Computational Introduction to Number Theory and Algebra
Price For All Three: $169.39

Some of these items ship sooner than the others. Show details

  • This item: Prime Numbers by Richard Crandall

    Usually ships within 2 to 5 weeks.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • Factorization and Primality Testing (Undergraduate Texts in Mathematics) by David M. Bressoud

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • A Computational Introduction to Number Theory and Algebra by Victor Shoup

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

Customers Who Bought This Item Also Bought

A Computational Introduction to Number Theory and Algebra

A Computational Introduction to Number Theory and Algebra

by Victor Shoup
5.0 out of 5 stars (2)  $50.40
An Introduction to the Theory of Numbers

An Introduction to the Theory of Numbers

by G. H. Hardy
4.6 out of 5 stars (13)  $54.00
Prime Numbers: The Most Mysterious Figures in Math

Prime Numbers: The Most Mysterious Figures in Math

by David Wells
4.2 out of 5 stars (8)  $18.21
Riemann's Zeta Function

Riemann's Zeta Function

by Harold M. Edwards
4.5 out of 5 stars (14)  $10.85
Elliptic Curves: Number Theory and Cryptography, Second Edition (Discrete Mathematics and Its Applications)

Elliptic Curves: Number Theory and Cryptography, Second Edition (Discrete Mathematics and Its Applications)

by Lawrence C. Washington
5.0 out of 5 stars (1)  $50.04
› Explore similar items

Editorial Reviews

Review

From the reviews:

MATHEMATICAL REVIEWS

"There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about them¿The book is clearly written and is a pleasure to read. It is largely self-contained. A first course in number theory and some knowledge of computer algorithms should be sufficient background for reading it…Each chapter concludes with a long list of interesting exercises and research problems."

BULLETIN OF THE AMS

"The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read! It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book."

AMERICAN SCIENTIST

"…a welcome addition to the literature of number theory – comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues."

SIAM REVIEW

"Overall, this book by Crandall and Pomerance fills a unique niche a deserves a place on the bookshelf of anyone with more than a passing interest in prime numbers. It would provide a gold mine of information and problems for a graduate class on computationl number theory."

From the reviews of the second edition:

"This book is a very successful attempt of the authors to describe the current state-of-the-art of computational number theory … . One of the many attractive features of this book is the rich and beautiful set of exercises and research problems … . the authors have managed to lay down their broad and deep insight in primes into this book in a very lucid and vivid way. … The book provides excellent material for graduate and undergraduate courses on computational theory. Warmly recommended … ." (H.J.J. te Riele, Nieuw Archief voor Wiskunde, Vol. 7 (3), 2006)

"An absolutely wonderful book! Written in a readable and enthusiastic style the authors try to share the elegance of the prime numbers with the readers … . Weaving together a wealth of ideas and experience from theory and practice they enable the reader to have more than a glimpse into the current state of the knowledge … . any chapter or section can be singled out for high praise. … Indeed it is destined to become a definitive text on … prime numbers and factoring." (Peter Shiu, Zentralblatt MATH, Vol. 1088 (14), 2006)



Product Description

"There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about them...The book is clearly written and is a pleasure to read." -Mathematical Reviews
See all Editorial Reviews

Product Details

  • Hardcover: 568 pages
  • Publisher: Springer; Corrected edition (May 28, 2002)
  • Language: English
  • ISBN-10: 0387947779
  • ISBN-13: 978-0387947778
  • Product Dimensions: 9.3 x 6.1 x 1.2 inches
  • Shipping Weight: 1.6 pounds (View shipping rates and policies)
  • Average Customer Review: 3.8 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon.com Sales Rank: #1,033,408 in Books (See Bestsellers in Books)

    •  Would you like to update product info or give feedback on images?

More About the Author

Richard E. Crandall
Discover books, learn about writers, read author blogs, and more.

› Visit Amazon's Richard E. Crandall Page
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:
Inside This Book (learn more)
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
elliptic multiplication, divisor search, negacyclic convolution, elliptic arithmetic, probable prime base, elliptic algebra, unfactored portion, convexity conjecture, discrete weighted transform, factored divisor, complete prime factorization, probable prime test, integer convolution, least prime factor, binary ladders, powering ladder, rho method, exponent vectors, least primitive root, elliptic addition, primality proofs, mutual key, nontrivial factorization, number field sieve, binary gcd
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Monte Carlo, Goldwasser Kilian, Toom Cook, Atkin Morain, Lucas Lehmer, Cooley Tukey, Danielson Lanczos, Diffie Hellman, Riemann Siegel, Van Loan, Wall Sun Sun
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:
Citations (learn more)
This book cites 35 books:
See all 35 books this book cites
 
54 books cite this book:
See all 54 books citing this book

Books on Related Topics (learn more)
 
 

Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 
(18)
(14)
(9)
(9)
(4)
(4)
(4)
(3)
(2)
(2)
(1)

Your tags: Add your first tag
 
See most popular tags

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more
 

Customer Reviews

4 Reviews
5 star:
 (2)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:
 (1)
 
 
 
 
 
Average Customer Review
3.8 out of 5 stars (4 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

 
24 of 24 people found the following review helpful:
5.0 out of 5 stars Standard reference on the subject., April 21, 2003
By Decio Luiz Gazzoni Filho (Londrina, PR Brazil) - See all my reviews
While recently published, this book is shaping to become the standard reference on the theory that surrounds prime numbers in a computational setting, drawing from all branches of number theory, as well as abstract algebra, analysis, combinatorics, statistics, complexity theory and elliptic curves. Surely a multidisciplinary treatise if there ever was one.

The authors' writing style, while not conversational, never gets in the way, and allows reading at many levels (from light reading to deep research). Theorems are proved only when it makes sense to do so, i.e. when the proof adds insight into the matter. The exercises are interesting and challenging, and closing each chapter are avenues of further research, referencing open problems in the literature and the authors' own opinion on interesting subjects for research.

The first chapter is an overview of theoretical and computational developments, with anything from Euclid's proof of the infinitude of primes, Riemann's study of the zeta function, down to the latest huge computation of the twin prime constant and zeros of the zeta function in the critical line. Some famous open problems are displayed as well.

The necessary number theory background is covered on Chapter 2, though the interested reader should seek a more complete treatise on the subject.

Trial division, sieving and pseudo-primality tests are fully covered in Chapter 3. There is really nothing to complain about this chapter of the book.

Chapter 4 concerns proving the primality of integers. Many results are presented from the classical (meaning not involving elliptic curves) primality tests, and again there is nothing to complain.

Many people, such as myself, are drawn to the book for the integer factoring algorithms, and they're not going to be disappointed. Unfortunately, modern factoing algorithms deserve a book on its own, and it's impossible to cover all the ground in the space alloted to them in this book. The authors do a pretty good job of introducing them, even if the explanation is unclear and a bit shallow at times, and they always reference other works on the field for further information they were unable to cover.

Chapter 7, ``Elliptic Curve Arithmetic,'' is a great starting point for elliptic curve studies, with a no-nonsense introduction to the subject that is certainly enough for the algorithms that follow. These include Lenstra's Elliptic Curve Method of factorization; Shanks-Mestre's, Schoof's and Atkin-Morain's algorithms for assessing curve order; and Goldwasser-Kilian's and Atkin-Morain's primality proving algorithms.

Almost as valuable as the rest of the book itself (at least for implementers) is the ninth and last chapter, ``Fast algorithms for large-integer arithmetic.'' Many of these can be carried over without effort to floating point, so the scope of the material is even broader than the authors claim. Having read parts of Knuth's ``The Art of Computer Programming: Seminumerical Algorithms,'' I can attest to the superb exposition of Crandall and Pomerance being a breath of fresh air in this field. This book belongs on the shelf of every programmer implementing multiprecision arithmetic for this chapter alone.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
21 of 21 people found the following review helpful:
5.0 out of 5 stars A Factoring "Bible", March 6, 2002
By Ed Prothro (Stillwater, OK United States) - See all my reviews
This book has all the recent (2001) developments in factoring algorithms and related number theory. It has chapters on algorithms for large numbers. While graduate-level, much of it should be accessible by an undergraduate. It has exercises and research questions after each chapter.

To find all the info in it, you would have to scour a research library for all the papers that have been published on factoring and primality testing -- they are scattered thru many math journals. It also covers things like quantum computing and cryptography.

It's a good reference - no need to read the whole thing. It would also make an excellent graduate-level textbook.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
5 of 6 people found the following review helpful:
4.0 out of 5 stars advanced coverage, September 22, 2005
By W Boudville (Terra, Sol 3) - See all my reviews
(TOP 10 REVIEWER)    (REAL NAME)      
This is an advanced treatment of prime numbers. But it is not all abstract number theory. The recurrent theme is how to compute these and how to use primes in other computationally intensive tasks.

The book summarises centuries of effort. Notably with Goldbach's Conjecture about every even number>2 being the sum of two primes. But intriguing issues like the density of primes along the number line are gone into. Along with the Mersenne primes and prime producing formulae.

An entire chapter discusses cryptography and related matters. Primes are at the heart of PKI and its RSA implementation. There is even a section briefly covering quantum computing and a quantum Turing Machine. Rather sparse detail because, well, the experimental results are still very new. Only baby steps have been forthcoming. The phase coherence difficulties are formidable. But it is a potentially vast area of future work.
Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)


Share your thoughts with other customers: Create your own review
 
 
Ad
 
Most Recent Customer Reviews

1.0 out of 5 stars Badly Bound
The book content is quite fascinating; the only real readability difficuly is some rather obscure and undefined notation. Read more
Published on May 17, 2004

Only search this product's reviews


Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   

Listmania!

Create a Listmania! list

So You'd Like to...

Create a guide

Product Information from the Amapedia Community

Beta (What's this?)

Look for Similar Items by Category

Look for Similar Items by Subject

Search Books by subject:













i.e., each book must be in subject 1 AND subject 2 AND ...
 

Feedback

If you need help or have a question for Customer Service, contact us.
 Would you like to update product info or give feedback on images?
Is there any other feedback you would like to provide?

Your comments can help make our site better for everyone.


Your Recent History

 (What's this?)

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.