An Asymptotic Formula for the Number of Smooth Values of a Polynomial
Greg Martin
Abstract
Although we expect to find many smooth numbers (i.e., numbers with no large prime factors) among the values taken by a polynomial with integer coefficients, it is unclear what the asymptotic number of such smooth values should be; this is in contrast to the related problem of counting the number of prime values of a polynomial, for which Bateman and Horn published a conjectured asymptotic formula that is widely believed to be true. We discuss how to employ the Bateman-Horn conjecture to derive an asymptotic formula for the number of smooth values of a polynomial, with the smoothness parameter in a non-trivial range. This conditional result provides a believable heuristic for the number of smooth integers among all values F(n), and also among the values F(p) on prime arguments only.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan