Softcover ISBN:  9781470410483 
Product Code:  STML/68 
List Price:  $59.00 
Individual Price:  $47.20 
Sale Price:  $38.35 
eBook ISBN:  9781470414139 
Product Code:  STML/68.E 
List Price:  $49.00 
Individual Price:  $39.20 
Sale Price:  $31.85 
Softcover ISBN:  9781470410483 
eBook: ISBN:  9781470414139 
Product Code:  STML/68.B 
List Price:  $108.00 $83.50 
Sale Price:  $70.20 $54.28 
Softcover ISBN:  9781470410483 
Product Code:  STML/68 
List Price:  $59.00 
Individual Price:  $47.20 
Sale Price:  $38.35 
eBook ISBN:  9781470414139 
Product Code:  STML/68.E 
List Price:  $49.00 
Individual Price:  $39.20 
Sale Price:  $31.85 
Softcover ISBN:  9781470410483 
eBook ISBN:  9781470414139 
Product Code:  STML/68.B 
List Price:  $108.00 $83.50 
Sale Price:  $70.20 $54.28 

Book DetailsStudent Mathematical LibraryVolume: 68; 2013; 293 ppMSC: Primary 112014 CHOICE Outstanding Academic Title
This book is about the theory and practice of integer factorization presented in a 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. Each of the ten chapters begins with a concise summary of its contents.
The book starts with a general explanation of why factoring integers is important. The next two chapters present number theory results that are relevant to factoring. Further on there is a chapter discussing, in particular, mechanical and electronic devices for factoring, as well as factoring using quantum physics and DNA molecules. Another chapter applies factoring to breaking certain cryptographic algorithms. Yet another chapter is devoted to practical vs. theoretical aspects of factoring. The book contains more than 100 examples illustrating various algorithms and theorems. It also contains more than 100 interesting exercises to test the reader's understanding. Hints or answers are given for about a third of the exercises. The book concludes with a dozen suggestions of possible new methods for factoring integers.
This book is written for readers who want to learn more about the best methods of factoring integers, many reasons for factoring, and some history of this fascinating subject. It can be read by anyone who has taken a first course in number theory.
ReadershipUndergraduate students, graduate students, and researchers in mathematics and computer science interested in number theory, in particular, methods for factoring integers.

Table of Contents

Chapters

Chapter 1. Why factor integers?

Chapter 2. Number theory review

Chapter 3. Number theory relevant to factoring

Chapter 4. How are factors used?

Chapter 5. Simple factoring algorithms

Chapter 6. Continued fractions

Chapter 7. Ellliptic curves

Chapter 8. Sieve algorithms

Chapter 9. Factoring devices

Chapter 10. Theoretical and practical factoring

Appendix. Answers and hints for exercises


Additional Material

Reviews

It 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 upperlevel 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.
CHOICE


RequestsReview Copy – for publishers of book reviewsDesk Copy – for instructors who have adopted an AMS textbook for a courseExamination Copy – for faculty considering an AMS textbook for a coursePermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Reviews
 Requests
This book is about the theory and practice of integer factorization presented in a 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. Each of the ten chapters begins with a concise summary of its contents.
The book starts with a general explanation of why factoring integers is important. The next two chapters present number theory results that are relevant to factoring. Further on there is a chapter discussing, in particular, mechanical and electronic devices for factoring, as well as factoring using quantum physics and DNA molecules. Another chapter applies factoring to breaking certain cryptographic algorithms. Yet another chapter is devoted to practical vs. theoretical aspects of factoring. The book contains more than 100 examples illustrating various algorithms and theorems. It also contains more than 100 interesting exercises to test the reader's understanding. Hints or answers are given for about a third of the exercises. The book concludes with a dozen suggestions of possible new methods for factoring integers.
This book is written for readers who want to learn more about the best methods of factoring integers, many reasons for factoring, and some history of this fascinating subject. It can be read by anyone who has taken a first course in number theory.
Undergraduate students, graduate students, and researchers in mathematics and computer science interested in number theory, in particular, methods for factoring integers.

Chapters

Chapter 1. Why factor integers?

Chapter 2. Number theory review

Chapter 3. Number theory relevant to factoring

Chapter 4. How are factors used?

Chapter 5. Simple factoring algorithms

Chapter 6. Continued fractions

Chapter 7. Ellliptic curves

Chapter 8. Sieve algorithms

Chapter 9. Factoring devices

Chapter 10. Theoretical and practical factoring

Appendix. Answers and hints for exercises

It 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 upperlevel 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.
CHOICE