Erdős–Odlyzko–Sárközy conjecture on products of two small primes

About 8 years old · traced to

Let kk be a positive integer and let aa be an integer coprime to kk. The primes p1p_1 and p2p_2 are required to satisfy p1,p2≤kp_1,p_2\leq k. Erdős–Odlyzko–Sárközy conjecture. For all sufficiently large kk and aa with (a,k)=1(a,k)=1, there exist primes p1,p2≤kp_1,p_2\leq k such that

p1p2≡a(modk).p_1p_2\equiv a\pmod{k}.

This conjecture is stated by Erdős, Odlyzko and Sárközy and is unreachable with current methods because of the parity problem; various relaxations are known.

References

Primary source

Kam Hung Yau, “Product of an integer free of small prime factors and prime in arithmetic progression”, arXiv:1812.10214 (2021).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.