Detailseite wird geladen...
2005, ISBN: 9780387252827
ID: 692212925
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. 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. From the reviews of the first edition: ´´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.´´ ´´...Prime Numbers is a welcome addition to the literature of number theory---comprehensive, up-to-date and written with style.´´ - American Scientist ´´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 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. The final chapter focusses on ´´applications´´ of prime numbers, incorporating the mathematics of finance, via quasi-Monte Bücher > Fremdsprachige Bücher > Englische Bücher gebundene Ausgabe 04.08.2005, Springer, .200
Buch.ch
No. 3092509 Shipping costs:zzgl. Versandkosten, plus shipping costs
Details... |
ISBN: 9780387252827
ID: 999b625449b69226691ac6db85eda26d
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. The final chapter focusses on "applications" of prime numbers, incorporating the mathematics of finance, via quasi-Monte Carlo 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. 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. From the reviews of the first edition: "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." "...Prime Numbers is a welcome addition to the literature of number theory---comprehensive, up-to-date and written with style." - American Scientist "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 Bücher / Fremdsprachige Bücher / Englische Bücher 978-0-387-25282-7, Springer
Buch.de
Nr. 3092509 Shipping costs:Bücher und alle Bestellungen die ein Buch enthalten sind versandkostenfrei, sonstige Bestellungen innerhalb Deutschland EUR 3,-, ab EUR 20,- kostenlos, Bürobedarf EUR 4,50, kostenlos ab EUR 45,-, Sofort lieferbar, DE. (EUR 0.00)
Details... |
ISBN: 9780387252827
[ED: Buch], [PU: Springer-Verlag GmbH], Neuware - 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., [SC: 0.00], Neuware, gewerbliches Angebot, 244x164x34 mm, [GW: 1010g]
Booklooker.de
Buchhandlung Hoffmann
Shipping costs:Versandkostenfrei, Versand nach Deutschland (EUR 0.00) Details... |
ISBN: 9780387252827
[ED: Buch], [PU: Springer-Verlag GmbH], Neuware - 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., [SC: 0.00], Neuware, gewerbliches Angebot, 244x164x34 mm, [GW: 1010g]
Booklooker.de |
2005, ISBN: 0387252827
ID: A4135402
2nd ed. Gebundene Ausgabe Primzahl, Zahlentheorie, MATHEMATICS / Number Theory, mit Schutzumschlag neu, [PU:Springer-Verlag GmbH]
Achtung-Buecher.de
REDIVIVUS Buchhandlung Hanausch Reinhard, 93053 Regensburg
Shipping costs:Versandkostenfrei innerhalb der BRD (EUR 0.00) Details... |
Author: | |
Title: | Prime Numbers |
ISBN: | 0387252827 |
Details of the book - Prime Numbers
EAN (ISBN-13): 9780387252827
ISBN (ISBN-10): 0387252827
Hardcover
Paperback
Publishing year: 2005
Publisher: Springer-Verlag GmbH
597 Pages
Weight: 1,075 kg
Language: eng/Englisch
Book in our database since 04.02.2007 13:38:57
Book found last time on 12.12.2016 14:14:56
ISBN/EAN: 0387252827
ISBN - alternate spelling:
0-387-25282-7, 978-0-387-25282-7
< to archive...
Nearby books
- "Embedded Image Processing on the TMS320C6000? DSP - Examples in Code Composer Studio? and MATLAB", from "Qureshi, Shehrzad" (9780387252810)
- "Embedded Image Processing on the TMS320C6000 DSP", from "Qureshi, Shehrzad" (9780387252803)
- "Mathematics and the Historian's Craft: The Kenneth O. May Lectures", from "Michael Kinyon" (9780387252841)
- "Small-Animal SPECT Imaging", from "Kupinski, Matthew A.; Barrett, Harrison H" (9780387252940)
- "Science of Microscopy", from "P.W. Hawkes" (9780387252964)
- "Multidisciplinary Scheduling", from "Michel Gendreau; Sanja Petrovic; Edmund K Burke; Graham Kendall" (9780387252674)