Products of primes in arithmetic progressions: a footnote in parity breaking
Olivier Ramar\'e, Aled Walker

TL;DR
This paper proves that for certain parameters, any invertible residue class modulo q can be represented by a product of exactly three small primes, extending understanding of prime products in arithmetic progressions.
Contribution
It establishes the existence of a product of three small primes in each invertible residue class modulo q under specific size constraints, advancing results in prime distribution in arithmetic progressions.
Findings
Existence of a product of three primes in each invertible residue class modulo q
Primes involved are all below x^{1/3}
Applicable for q up to x^{1/16}
Abstract
We prove that, if and are two parameters, then for any invertible residue class modulo there exists a product of exactly three primes, each one below , that is congruent to modulo .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Algebraic Geometry and Number Theory
