Conjecture on approximation by rationals with prime denominators

From papers

Let ξ\xi be a real number, let aa be an integer, and let pp be a prime number. Consider rational approximations a/pa/p whose error is measured by

ξap.\left|\xi-\frac{a}{p}\right|.

Prime-denominator approximation conjecture. For every real ξ\xi, there exists a constant c(ξ)c(\xi) such that the inequality

ξap<c(ξ)lnpp2\left|\xi-\frac{a}{p}\right|<\frac{c(\xi)\ln p}{p^2}

with pp prime has infinitely many solutions in integers aa and prime numbers pp. The claim is presented as a conjectural consequence of the density of primes and a constructive procedure; the supplied text gives no proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

I. Jimenez Calvo, “An algorithm to approximate reals by rationals of the form a/b^2”, arXiv:math/0702464 (2007).

Solutions 0

No solutions have been posted yet.