Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Prime Numbers: A Computational Perspective

Prime Numbers: A Computational Perspective

Crandall, Richard
Pomerance, Carl B.

Paperback

General Mathematics

ISBN10: 1441920501
ISBN13: 9781441920508
Publisher: Springer
Published: Oct 29 2010
Pages: 597
Weight: 1.87
Height: 1.24 Width: 6.14 Depth: 9.21
Language: English

In the new edition of this highly successful book, Richard Crandall and Carl Pomerance have provided updated material on theoretical, computational, and algorithmic fronts, including the striking new AKS test for recognizing prime numbers. Other examples: new computational results on the Riemann hypothesis, a very new and superfast pure-binary algorithm for the greatest common divisor, and new forms of the fast Fourier transform. The authors also list many new computational records and survey new developments in the theory of prime numbers, including the proof that there are arbitrarily long arithmetic progressions of primes and the proof that 8 and 9 are the only consecutive powers. Numerous exercises have also been added.

Also from

Crandall, Richard

View All

Also in

General Mathematics

View All