Conjecture on approximation by rationals with prime denominators
Conjecture on approximation by rationals with prime denominators
Let be a real number, let be an integer, and let be a prime number. Consider rational approximations whose error is measured by
Prime-denominator approximation conjecture. For every real , there exists a constant such that the inequality
with prime has infinitely many solutions in integers and prime numbers . 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
Sign in to submit a solution.
No solutions have been posted yet.