Lower Bounds for the Number of Smooth Values of a Polynomial
Greg Martin
Abstract
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial from above, a corresponding lower bound of the correct order of magnitude has hitherto been established only in a few special cases. The purpose of this paper is to provide such a lower bound for an arbitrary polynomial. Various generalizations to subsets of the set of values taken by a polynomial are also obtained.
Create a lesson
Related papers
An Infinite Family of Apéry-like Recurrences for Euler's Constant
Rotem Kalisch, Tali Monderer, Elyasheev Leibtag et al.
On the saturability of p-adic Lie groups
Casey Perdue
On Divisor Function Polynomials and Dirichlet Series
Martin N. Huxley, Matthew C. Lettington, Karl Michael Schmidt
On a conjecture on Romanoff type representations
Xiao-Hui Yan
Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of (-1)ω(n)
A. Alvarez Cruz, E. A. Alvarez Gutierrez
Appell Sequences in Analytic Number Theory: Shifted Expansions and Dirichlet L-Functions
Abdelmejid Bayad