Details

Prime Numbers


Prime Numbers

A Computational Perspective
2nd ed. 2005

von: Richard Crandall, Carl B. Pomerance

96,29 €

Verlag: Springer
Format: PDF
Veröffentl.: 07.04.2006
ISBN/EAN: 9780387289793
Sprache: englisch
Anzahl Seiten: 597

Dieses eBook enthält ein Wasserzeichen.

Beschreibungen

<P>Bridges the gap between theoretical and computational aspects of prime numbers</P>
<P>Exercise sections are a goldmine of interesting examples, pointers to the literature and potential research projects</P>
<P>Authors are well-known and highly-regarded in the field</P>
<P>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<SUP>nd</SUP> 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.</P>
<P></P>
<P>From the reviews of the first edition:</P>
<P></P>
<P>"…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 theory—comprehensive, 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</P>
<P></P>
<P>"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. …" L’Enseignement Mathématique</P>
<P></P>
<P>"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</P>
Preface.- Primes!.- Number-Theoretical Tools.- Recognizing Primes and Composites.-Primality Proving.- Exponential Factoring Algorithms.- Subexponential Factoring Algorithms.- Elliptic Curve Arithmetic.- The Ubiquity of Prime Numbers.- Fast Algorithms for Large-Integer Arithmetic.- Book Pseudocode.- References.- Index.
<p>Richard Crandall currently holds the title of Apple Distinguished Scientist, having previously been Apples Chief Cryptographer, the Chief Scientist at NeXT, Inc., and recipient of the Vollum Chair of Science at Reed College. His primary interest is interdisciplinary scientific computation, though he has authored numerous theoretical papers in quantum physics, biology, mathematics, and chemistry, as well as various patents across engineering fields. </p>
<p></p>
<p>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.</p>
<p>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.</p>
<p>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.</p>
<p>From the reviews of the first edition:</p>
<p>"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." </p>
^ L'Enseignement Mathématique<p></p>
<p>"...Prime Numbers is a welcome addition to the literature of number theory---comprehensive, up-to-date and written with style." </p>
<p>- American Scientist</p>
<p>"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."</p>
<p>- Bulletin of the AMS</p>
<p>Bridges the gap between theoretical and computational aspects of prime numbers</p><p>Exercise sections are a goldmine of interesting examples, pointers to the literature and potential research projects</p><p>Authors are well-known and highly-regarded in the field</p><p>Includes supplementary material: sn.pub/extras</p>
<p>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.</p>
<p>About the first edition:</p>
<p>"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."</p>
<p>- Bulletin of the AMS</p>

Diese Produkte könnten Sie auch interessieren:

Modeling Uncertainty
Modeling Uncertainty
von: Moshe Dror, Pierre L'Ecuyer, Ferenc Szidarovszky
PDF ebook
236,81 €
Level Crossing Methods in Stochastic Models
Level Crossing Methods in Stochastic Models
von: Percy H. Brill
PDF ebook
203,29 €
Continuous Bivariate Distributions
Continuous Bivariate Distributions
von: N. Balakrishnan, Chin Diew Lai
PDF ebook
128,39 €