Roger Baker
Published 2017-04-19Version 1
We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the exponent that measures the distance, compared with the most recent result in the literature.
Fractional parts of polynomials over the primes
Sums of square roots that are close to an integer
Arithmetic functions on average over values of quadratic polynomial
![QR code for arXiv:1704.05898 [math.NT]](http://oss.arxitics.com/images/favicon.svg)