Prime Numbers

A Computational Perspective

Richard Crandall, Carl Pomerance

616 pages, parution le 31/08/2005 (2^eme édition)

Ajouter à une liste

Indisponible

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

Sommaire

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
App Book pseudocode

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Richard Crandall, Carl Pomerance
Parution	31/08/2005
Édition	2^eme édition
Nb. de pages	616
Format	16 x 24
Couverture	Relié
Poids	1005g
Intérieur	Noir et Blanc
EAN13	9780387252827
ISBN13	978-0-387-25282-7