Description
Book SynopsisExamines the theory and practice of integer factorisation from an historic perspective. It describes about twenty algorithms for factoring and a dozen other number theory algorithms that support the factoring algorithms. Most algorithms are described both in words and in pseudocode to satisfy both number theorists and computer scientists.
Trade ReviewIt is, I think, a fairly safe bet that most students learning about factoring do not instinctively view the subject as having anything whatsoever to do with 'joy'. ... [B]y contrast, most people (even many math students) equate factoring with tedium. Consequently, anybody setting out to write a book entitled The Joy of Factoring is automatically faced with a double objective. The author must not only teach the reader something about factoring, but must also explain why anybody should care. The book under review succeeds on both counts. ... I think a second course in number theory, or senior seminar, based on this book would be quite interesting. ... The book could also be used as a text for an upper-level course in computer science for students with some background in number theory. It also certainly belongs in any good university library, if only because the material collected in it is not (to my knowledge at any rate) readily available in the textbook literature." - Mark Hunacek,
MAA Reviews"This work is a pleasure to read; it is a must for anyone interested in numbers, programming, and codes. The extensive bibliography gives readers direction and the tools to quickly delve deeper into the field. ... Highly recommended." -
CHOICETable of Contents
- Preface
- Why factor integers?
- Number theory review
- Number theory relevant to factoring
- How are factors used?
- Simple factoring algorithms
- Continued fractions
- Ellliptic curves
- Sieve algorithms
- Factoring devices
- Theoretical and practical factoring
- Answers and hints for exercises
- Bibliography
- Index
