Prime Numbers: A Computational Perspective
| Date: 08 May 2011, 00:30
|
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.
From the reviews of the first edition:
"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 theorycomprehensive, 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
"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. " LEnseignement Mathematique
"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
From the reviews:
MATHEMATICAL 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."
BULLETIN OF THE AMS
"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."
AMERICAN SCIENTIST
"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."
SIAM REVIEW
"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."
PassWord: ebooksclub.org
|
DISCLAIMER:
This site does not store Prime Numbers: A Computational Perspective on its server. We only index and link to Prime Numbers: A Computational Perspective provided by other sites. Please contact the content providers to delete Prime Numbers: A Computational Perspective if any and email us, we'll remove relevant links or contents immediately.
Comments (0)
All
