Conjecture on approximation by rationals with prime denominators
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.