The number of integer points close to a polynomial
Patrick Letendre
所有作者
Patrick Letendre
文献摘要
Let f(x) be a polynomial of degree n≥1 with real coefficients and let
X≥2 and δ≥0 be real numbers. Let ∥⋅∥ be the distance
to the nearest integer. We obtain upper bounds for the number of solutions to
the inequality ∥f(x)∥≤δ with x∈[X,2X]∩N.