Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Richard Crandall | - |
| dc.contributor.other | Carl Pomerance. | - |
| dc.date.accessioned | 2021-10-23T03:39:43Z | - |
| dc.date.available | 2021-10-23T03:39:43Z | - |
| dc.date.issued | 2005 | - |
| dc.identifier.uri | https://thuvienso.thanglong.edu.vn/handle/TLU/112 | - |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | New York, NY : Springer | en_US |
| dc.subject | Numbers, Prime | Số nguyên tố | Toán học | en_US |
| dc.title | Prime numbers | en_US |
| dc.title.alternative | A computational perspective | en_US |
| dc.type | Book | en_US |
| Appears in Collections | Toán - Tin - Kinh tế | |
Files in This Item:
