Prime Numbers A Computational Perspective

ISBN-10: 0387252827

ISBN-13: 9780387252827

Edition: 2nd 2005 (Revised)

Authors: Richard Crandall, Carl B. Pomerance

List price: $89.99 Buy it from $82.49
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


Prime numbers beckon to the beginner, the basic notion of primality being accessible to a child. Yet, some of the simplest questions about primes have stumped humankind for millennia. In this book, the authors concentrate on the computational aspects of prime numbers, such as recognizing primes and discovering the fundamental prime factors of a given number. Over 100 explicit algorithms cast in detailed pseudocode are included in the book. Applications and theoretical digressions serve to illuminate, justify, and underscore the practical power of these algorithms. The 2 nd edition adds new material on primality and algorithms and updates all the numerical records, such as the largest prime, etc. It has been revised throughout. From the reviews of the first edition: "The exercises are a gold mine of interesting examples, pointers to the literature and potential research projects. Prime Numbers is a welcome addition to the literature of number theorycomprehensive, 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." American Scientist "Destined to become a definitive textbook conveying the most modern computational ideas about prime numbers and factoring, this book will stand as an excellent reference for this kind of computation, and thus be of interest to both educators and researchers. It is also a timely book, since primes and factoring have reached a certain vogue, partly because of cryptography. " LEnseignement Mathmatique "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." Bulletin of the AMS
New Starting from $92.74
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Medical Terminology Online content $4.95 $1.99
Add to cart
Study Briefs
Medical Math Online content $4.95 $1.99
Customers also bought

Book details

List price: $89.99
Edition: 2nd
Copyright year: 2005
Publisher: Springer
Publication date: 8/4/2005
Binding: Hardcover
Pages: 597
Size: 6.25" wide x 9.50" long x 1.50" tall
Weight: 2.244
Language: English

Problems and progress
Fundamental theorem and fundamental problem
Technological and algorithmic progress
The infinitude of primes
Asymptotic relations and order nomenclature
How primes are distributed
Celebrated conjectures and curiosities
Twin primes
Prime k-tuples and hypothesis H
The Goldbach conjecture
The convexity question
Prime-producing formulae
Primes of special form
Mersenne primes
Fermat numbers
Certain presumably rare primes
Analytic number theory
The Riemann zeta function
Computational successes
Dirichlet L-functions
Exponential sums
Smooth numbers
Research problems
Number-Theoretical Tools
Modular arithmetic
Greatest common divisor and inverse
Chinese remainder theorem
Polynomial arithmetic
Greatest common divisor for polynomials
Finite fields
Squares and roots
Quadratic residues
Square roots
Finding polynomial roots
Representation by quadratic forms
Research problems
Recognizing Primes and Composites
Trial division
Divisibility tests
Trial division
Practical considerations
Theoretical considerations
Sieving to recognize primes
Eratosthenes pseudocode
Sieving to construct a factor table
Sieving to construct complete factorizations
Sieving to recognize smooth numbers
Sieving a polynomial
Theoretical considerations
Recognizing smooth numbers
Fermat pseudoprimes
Carmichael numbers
Probable primes and witnesses
The least witness for n
Lucas pseudoprimes
Fibonacci and Lucas pseudoprimes
Grantham's Frobenius test
Implementing the Lucas and quadratic Frobenius tests
Theoretical considerations and stronger tests
The general Frobenius test
Counting primes
Combinatorial method
Analytic method
Research problems
Primality Proving
The n - 1 test
The Lucas theorem and Pepin test
Partial factorization
Succinct certificates
The n + 1 test
The Lucas-Lehmer test
An improved n + 1 test, and a combined n[superscript 2] - 1 test
Divisors in residue classes
The finite field primality test
Gauss and Jacobi sums
Gauss sums test
Jacobi sums test
The primality test of Agrawal, Kayal, and Saxena (AKS test)
Primality testing with roots of unity
The complexity of Algorithm 4.5.1
Primality testing with Gaussian periods
A quartic time primality test
Research problems
Exponential Factoring Algorithms
Fermat method
Lehman method
Factor sieves
Monte Carlo methods
Pollard rho method for factoring
Pollard rho method for discrete logarithms
Pollard lambda method for discrete logarithms
Baby-steps, giant-steps
Pollard p - 1 method
Polynomial evaluation method
Binary quadratic forms
Quadratic form fundamentals
Factoring with quadratic form representations
Composition and the class group
Ambiguous forms and factorization
Research problems
Subexponential Factoring Algorithms
The quadratic sieve factorization method
Basic QS
Basic QS: A summary
Fast matrix methods
Large prime variations
Multiple polynomials
Self initialization
Zhang's special quadratic sieve
Number field sieve
Basic NFS: Strategy
Basic NFS: Exponent vectors
Basic NFS: Complexity
Basic NFS: Obstructions
Basic NFS: Square roots
Basic NFS: Summary algorithm
NFS: Further considerations
Rigorous factoring
Index-calculus method for discrete logarithms
Discrete logarithms in prime finite fields
Discrete logarithms via smooth polynomials and smooth algebraic integers
Research problems
Elliptic Curve Arithmetic
Elliptic curve fundamentals
Elliptic arithmetic
The theorems of Hasse, Deuring, and Lenstra
Elliptic curve method
Basic ECM algorithm
Optimization of ECM
Counting points on elliptic curves
Shanks-Mestre method
Schoof method
Atkin-Morain method
Elliptic curve primality proving (ECPP)
Goldwasser-Kilian primality test
Atkin-Morain primality test
Fast primality-proving via ellpitic curves (fastECPP)
Research problems
The Ubiquity of Prime Numbers
Diffie-Hellman key exchange
RSA cryptosystem
Elliptic curve cryptosystems (ECCs)
Coin-flip protocol
Random-number generation
Modular methods
Quasi-Monte Carlo (qMC) methods
Discrepancy theory
Specific qMC sequences
Primes on Wall Street?
Diophantine analysis
Quantum computation
Intuition on quantum Turing machines (QTMs)
The Shor quantum algorithm for factoring
Curious, anecdotal, and interdisciplinary references to primes
Research problems
Fast Algorithms for Large-Integer Arithmetic
Tour of "grammar-school" methods
Div and mod
Enhancements to modular arithmetic
Montgomery method
Newton methods
Moduli of special form
Basic binary ladders
Enhancements to ladders
Enhancements for gcd and inverse
Binary gcd algorithms
Special inversion algorithms
Recursive-gcd schemes for very large operands
Large-integer multiplication
Karatsuba and Toom-Cook methods
Fourier transform algorithms
Convolution theory
Discrete weighted transform (DWT) methods
Number-theoretical transform methods
Schonhage method
Nussbaumer method
Complexity of multiplication algorithms
Application to the Chinese remainder theorem
Polynomial arithmetic
Polynomial multiplication
Fast polynomial inversion and remaindering
Polynomial evaluation
Research problems
Book Pseudocode
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.