Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: Prime Numbers by Richard Crandall, Carl Pomerance ISBN: 0-387-94777-9 Publisher: Telos Pr Pub. Date: 30 March, 2001 Format: Hardcover Volumes: 1 List Price(USD): $59.95 |
Average Customer Rating: 3.67 (3 reviews)
Rating: 1
Summary: Badly Bound
Comment: The book content is quite fascinating; the only real readability difficuly is some rather obscure and undefined notation.
The physical quality of the book is inexcusably bad. The brand new book started falling apart as soon as it was opened. Springer Verlag, the publisher, refused to correct the situation.
I shan't again buy anything publishd by Springer-Verlag!
Rating: 5
Summary: Standard reference on the subject.
Comment: While recently published, this book is shaping to become the standard reference on the theory that surrounds prime numbers in a computational setting, drawing from all branches of number theory, as well as abstract algebra, analysis, combinatorics, statistics, complexity theory and elliptic curves. Surely a multidisciplinary treatise if there ever was one.
The authors' writing style, while not conversational, never gets in the way, and allows reading at many levels (from light reading to deep research). Theorems are proved only when it makes sense to do so, i.e. when the proof adds insight into the matter. The exercises are interesting and challenging, and closing each chapter are avenues of further research, referencing open problems in the literature and the authors' own opinion on interesting subjects for research.
The first chapter is an overview of theoretical and computational developments, with anything from Euclid's proof of the infinitude of primes, Riemann's study of the zeta function, down to the latest huge computation of the twin prime constant and zeros of the zeta function in the critical line. Some famous open problems are displayed as well.
The necessary number theory background is covered on Chapter 2, though the interested reader should seek a more complete treatise on the subject.
Trial division, sieving and pseudo-primality tests are fully covered in Chapter 3. There is really nothing to complain about this chapter of the book.
Chapter 4 concerns proving the primality of integers. Many results are presented from the classical (meaning not involving elliptic curves) primality tests, and again there is nothing to complain.
Many people, such as myself, are drawn to the book for the integer factoring algorithms, and they're not going to be disappointed. Unfortunately, modern factoing algorithms deserve a book on its own, and it's impossible to cover all the ground in the space alloted to them in this book. The authors do a pretty good job of introducing them, even if the explanation is unclear and a bit shallow at times, and they always reference other works on the field for further information they were unable to cover.
Chapter 7, ``Elliptic Curve Arithmetic,'' is a great starting point for elliptic curve studies, with a no-nonsense introduction to the subject that is certainly enough for the algorithms that follow. These include Lenstra's Elliptic Curve Method of factorization; Shanks-Mestre's, Schoof's and Atkin-Morain's algorithms for assessing curve order; and Goldwasser-Kilian's and Atkin-Morain's primality proving algorithms.
Almost as valuable as the rest of the book itself (at least for implementers) is the ninth and last chapter, ``Fast algorithms for large-integer arithmetic.'' Many of these can be carried over without effort to floating point, so the scope of the material is even broader than the authors claim. Having read parts of Knuth's ``The Art of Computer Programming: Seminumerical Algorithms,'' I can attest to the superb exposition of Crandall and Pomerance being a breath of fresh air in this field. This book belongs on the shelf of every programmer implementing multiprecision arithmetic for this chapter alone.
Rating: 5
Summary: A Factoring "Bible"
Comment: This book has all the recent (2001) developments in factoring algorithms and related number theory. It has chapters on algorithms for large numbers. While graduate-level, much of it should be accessible by an undergraduate. It has exercises and research questions after each chapter.
To find all the info in it, you would have to scour a research library for all the papers that have been published on factoring and primality testing -- they are scattered thru many math journals. It also covers things like quantum computing and cryptography.
It's a good reference - no need to read the whole thing. It would also make an excellent graduate-level textbook.
 |
Title: Riemann's Zeta Function by Harold M. Edwards ISBN: 0486417409 Publisher: Dover Publications Pub. Date: 01 June, 2001 List Price(USD): $14.95 |
 |
Title: Factorization and Primality Testing (Undergraduate Texts in Mathematics) by David M. Bressoud ISBN: 0387970401 Publisher: Springer-Verlag Pub. Date: 01 October, 1989 List Price(USD): $54.95 |
 |
Title: Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics by John Derbyshire ISBN: 0309085497 Publisher: Joseph Henry Press Pub. Date: 23 April, 2003 List Price(USD): $27.95 |
 |
Title: Number Theory (Dover Books on Advanced Mathematics) by George E. Andrews ISBN: 0486682528 Publisher: Dover Publications Pub. Date: 01 October, 1994 List Price(USD): $8.95 |
 |
Title: Gamma : Exploring Euler's Constant by Julian Havil ISBN: 0691099839 Publisher: Princeton University Press Pub. Date: 17 March, 2003 List Price(USD): $29.95 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
