DeepRead
Cover of Prime Numbers

About the book

A computational treatment of prime numbers, covering their distribution, the theory behind them, and the algorithms used to test and factor integers. It is written by Richard Crandall with Carl Pomerance and treats number theory and computer implementation together, including applications such as public-key cryptography. Its central position is that prime numbers are best understood through computation, so that algorithms, numerical experiments, and theory inform one another. It develops primality tests and factoring methods, from elementary probabilistic tests to sieves, and explains how their practical performance shapes what is feasible in cryptography. It also connects the observed distribution of primes to classical analytic results such as the prime number theorem.

Written by Claude from what it knows of this book.

What Hacker News says 33% recommend · 0% critical

00.51201620172018201920202016 peak · 1
This bookAverage book in Mathematician biographies

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2001
ISBN
9780387252827
Editions known
4 at Open Library
Open Library
OL2362595W

512/.72Numbers, PrimeNumbers, primePrime NumbersQa246 .c74 2001

Explore in the mosaic

Read next: its neighbours on the mosaic