| Titre : |
Prime numbers : a computational persprective |
| Type de document : |
texte imprimé |
| Auteurs : |
Richard E. Crandall (1947-....), Auteur ; Carl Pomerance, Auteur |
| Mention d'édition : |
2nd ed. |
| Editeur : |
New York : Springer |
| Année de publication : |
cop. 2005 |
| ISBN/ISSN/EAN : |
978-0-387-25282-7 |
| Langues : |
Anglais (eng) |
| Catégories : |
Mathématiques
Mathématiques:Algèbre
|
| Mots-clés : |
Nombres premiers |
| Index. décimale : |
512 Algèbre |
| Résumé : |
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 2nd 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.
Written for: Mathematicians, graduate and advanced undergraduate students of mathematics, computer scientists |
Prime numbers : a computational persprective [texte imprimé] / Richard E. Crandall (1947-....), Auteur ; Carl Pomerance, Auteur . - 2nd ed. . - New York : Springer, cop. 2005. ISBN : 978-0-387-25282-7 Langues : Anglais ( eng)
| Catégories : |
Mathématiques
Mathématiques:Algèbre
|
| Mots-clés : |
Nombres premiers |
| Index. décimale : |
512 Algèbre |
| Résumé : |
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 2nd 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.
Written for: Mathematicians, graduate and advanced undergraduate students of mathematics, computer scientists |
|  |
Affiner la recherche Interroger des sources externes
