Facebook Twitter Pinterest
Nur noch 1 auf Lager
Verkauf und Versand durch Delhi_Book_Store. Für weitere Informationen, Impressum, AGB und Widerrufsrecht klicken Sie bitte auf den Verkäufernamen.
EUR 53,33 + EUR 3,00 Versandkosten
+ EUR 3,00 Versandkosten
Gebraucht: Sehr gut | Details
Verkauft von antiquariat-in-berlin
Zustand: Gebraucht: Sehr gut
Kommentar: Hardcover New York, Springer, 2001. 547 S. Ill. Very good condition.
Andere Verkäufer auf Amazon
In den Einkaufswagen
EUR 64,60
+ EUR 3,00 Versandkosten
Verkauft von: London Lane Company
Möchten Sie verkaufen? Bei Amazon verkaufen
Zur Rückseite klappen Zur Vorderseite klappen
Hörprobe Wird gespielt... Angehalten   Sie hören eine Hörprobe des Audible Hörbuch-Downloads.
Mehr erfahren
Dieses Bild anzeigen

Prime Numbers: A Computational Perspective (Englisch) Gebundene Ausgabe – 1. Juni 2002

5.0 von 5 Sternen 1 Kundenrezension

Alle 4 Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Neu ab Gebraucht ab
Kindle Edition
Gebundene Ausgabe, 1. Juni 2002
EUR 53,33
EUR 51,08 EUR 18,96

Dieses Buch gibt es in einer neuen Auflage:

click to open popover

Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.

  • Apple
  • Android
  • Windows Phone

Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.

Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.




From the reviews:


"There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about them¿The book is clearly written and is a pleasure to read. It is largely self-contained. A first course in number theory and some knowledge of computer algorithms should be sufficient background for reading it…Each chapter concludes with a long list of interesting exercises and research problems."


"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."


"…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."


"Overall, this book by Crandall and Pomerance fills a unique niche a deserves a place on the bookshelf of anyone with more than a passing interest in prime numbers. It would provide a gold mine of information and problems for a graduate class on computationl number theory."

From the reviews of the second edition:

"This book is a very successful attempt of the authors to describe the current state-of-the-art of computational number theory … . One of the many attractive features of this book is the rich and beautiful set of exercises and research problems … . the authors have managed to lay down their broad and deep insight in primes into this book in a very lucid and vivid way. … The book provides excellent material for graduate and undergraduate courses on computational theory. Warmly recommended … ." (H.J.J. te Riele, Nieuw Archief voor Wiskunde, Vol. 7 (3), 2006)

"An absolutely wonderful book! Written in a readable and enthusiastic style the authors try to share the elegance of the prime numbers with the readers … . Weaving together a wealth of ideas and experience from theory and practice they enable the reader to have more than a glimpse into the current state of the knowledge … . any chapter or section can be singled out for high praise. … Indeed it is destined to become a definitive text on … prime numbers and factoring." (Peter Shiu, Zentralblatt MATH, Vol. 1088 (14), 2006)

"This impressive book represents a comprehensive collection of the properties of prime numbers. … in the exercises at the end of each chapter valuable hints are given how the theorems have been attained. The chapters end with research exercises. The book is up to date and carefully written. … The volume is very vividly and even entertainingly written and is best suited for students and for teachers as well." (J. Schoissengeier, Monatshefte für Mathematik, Vol. 150 (1), 2007)

"The aim of this book is to bridge the gap between prime-number theory covered in many books and the relatively new area of computer experimentation and algorithms. The aim is admirably met. … There is a comprehensive and useful list of almost 500 references including many to websites. … This is an interesting, well-written and informative book neatly covering both the theoretical as well as the practical computational implementation of prime numbers and many related topics at first-year undergraduate level." (Ron Knott, The Mathematical Gazette, Vol. 92 (523), 2008)


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. This book can be read on several levels. For those wanting a taste of the lore of prime numbers and the principal methods to deal with them, the book provides a friendly introduction. For those wanting to delve deeper into the essential details of the most up-to-date methods for prime number computations, the book has such details and many references to the huge literature on the subject. Students can test their understanding with interesting exercises, including some entertaining, nonstandard ones.

And for those wishing to start or enrich a research program in computational prime number theory, the many unsolved problems in the text, and research problems in the exercises, provide rich ground for further work.

Alle Produktbeschreibungen


Sagen Sie Ihre Meinung zu diesem Artikel
Alle 1 Kundenrezensionen anzeigen


am 13. April 2016
Format: Gebundene Ausgabe|Verifizierter Kauf

Die hilfreichsten Kundenrezensionen auf Amazon.com

Amazon.com: 4,2 von 5 Sternen 8 Rezensionen
4,0 von 5 SternenPirme Numbers
am 3. April 2016 - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe|Verifizierter Kauf
5,0 von 5 Sternenterrific book lots of material to think about and also ...
am 29. Mai 2017 - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe|Verifizierter Kauf
3 Personen fanden diese Informationen hilfreich.
5,0 von 5 SternenThis is not a book for casual reading, or indeed even for studious reading: it requires devotion
am 31. März 2015 - Veröffentlicht auf Amazon.com
Verifizierter Kauf
35 Personen fanden diese Informationen hilfreich.
5,0 von 5 SternenStandard reference on the subject.
am 22. April 2003 - Veröffentlicht auf Amazon.com
10 Personen fanden diese Informationen hilfreich.
4,0 von 5 Sternenadvanced coverage
am 23. September 2005 - Veröffentlicht auf Amazon.com

Wo ist meine Bestellung?

Versand & Rücknahme

Brauchen Sie Hilfe?