+30 210 64 66 118
Save 51%

Prime Numbers: A Computational Perspective

9780387252827
Upon request Dispatched within 10 - 15 working days. Ρrovided that there’s sufficient stock at the supplier.
35.00 
List price: 71.00 
You save: 36.00 € (51%)
+
Add to wish list

Prime numbers beckon to the beginner, as the basic notion of primality is accessible even to children. Yet, some of the simplest questions about primes have confounded humankind for millennia. In the new edition of this highly successful book, Richard Crandall and Carl Pomerance have provided updated material on theoretical, computational, and algorithmic fronts. New results discussed include the AKS test for recognizing primes, computational evidence for the Riemann hypothesis, a fast binary algorithm for the greatest common divisor, nonuniform fast Fourier transforms, and more. The authors also list new computational records and survey new developments in the theory of prime numbers, including the magnificent proof that there are arbitrarily long arithmetic progressions of primes, and the final resolution of the Catalan problem. Numerous exercises have been added.

Category:
Science
Cover:
Hardback
Edition Number:
2
ISBN:
9780387252827
Pages:
597
Author:
Crandall Richard
Publisher:
SPRINGER
Release Year:
2005

Richard Crandall currently holds the title of Apple Distinguished Scientist, having previously been Apple's Chief Cryptographer, the Chief Scientist at NeXT, Inc., and recipient of the Vollum Chair of Science at Reed College. Though he publishes in quantum physics, biology, mathematics, and chemistry, and holds various engineering patents, his primary interest is interdisciplinary scientific computation. Carl Pomerance is the recipient of the Chauvenet and Conant Prizes for expository mathematical writing. He is currently a mathematics professor at Dartmouth College, having previously been at the University of Georgia and Bell Labs. A popular lecturer, he is well known for his research in computational number theory, his efforts having produced important algorithms now in use.

Carl Pomerance received his Ph.D. in mathematics from Harvard University in 1972. Currently he is a professor at Dartmouth College. A popular lecturer and winner of the Chauvenet and Conant Prizes for expository mathematical writing, Pomerance is well known for his research in computational number theory, his efforts having produced important algorithms now in wide use.

Save 10%
Add to wish list
Save 10%
Add to wish list
Save 10%
Add to wish list
Save 10%
Add to wish list
Save 10%
The Development of Mathematics
26.20 
29.00 
Add to wish list