ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c,d∈Zc,d\in\mathbb Z be relatively prime. A prime pp congruent to cc modulo dd is a prime of the form p=dz+cp=dz+c for some integer zz.

Xylouris's least-prime bound. For any relatively prime cc and dd, there exists a prime pp congruent to cc modulo dd such that

p≪d5.2.p\ll d^{5.2}.

Equivalently, there exists z≪d4.2z\ll d^{4.2} such that p=dz+cp=dz+c 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.