Smooth Numbers: Computational Number Theory and Beyond

Smooth Numbers: Computational Number Theory and Beyond
by Andrew Granville

Publisher: Universite de Montreal 2008
Number of pages: 58

Description:
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.