Xylouris's least-prime bound in an arithmetic progression
Statement
Let be relatively prime. A prime congruent to modulo is a prime of the form for some integer .
Xylouris's least-prime bound. For any relatively prime and , there exists a prime congruent to modulo such that
Equivalently, there exists such that is prime. This is presented in the paper as a theorem rather than a conjecture, and supplies an unconditional quantitative bound for primes in arithmetic progressions.
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.