Smooth Numbers: Computational Number Theory and Beyond
by Andrew Granville
Publisher: Universite de Montreal 2008
Number of pages: 58
The analysis of many number theoretic algorithms turns on the role played by integers which have only small prime factors; such integers are known as 'smooth numbers'. To be able to determine which algorithm is faster than which, it has turned out to be important to have accurate estimates for the number of smooth numbers in various sequences.
Home page url
Download or read it online for free here:
by Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
by William A. Stein - American Mathematical Society
This book fills a significant gap in the extensive literature on classical modular forms. This is not just yet another introductory text to this theory, though it could certainly be used as such in conjunction with more traditional treatments.
by Henry Ibstedt - Erhus University Press
The author uses computers to explore the solutions to some problems in number theory. The emphasis is on the statement of a problem and the examination of the solutions for numbers in a selected range. Many of the problems are very hard.
by J.P. Buhler, P. Stevenhagen - Cambridge University Press
This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students. It covers the fundamental algorithms of elementary number theory, lattice basis reduction, elliptic curves, algebraic number fields, etc.