Preprint demonstrates that arithmetic progressions with coprime terms contain infinitely many primes, indicating broader implications in number theory.
Preprint v1 — A proof that every arithmetic progression a, a+d, a+2d, ... with gcd(a,d)=1 contains infinitely many primes. Abstract redacted pending IP review. Full abstract and unrestricted access will be available in v2 upon completion of intellectual property proceedings.
No takes yet. Share an insight, caveat, or question.
Joseph R. Keen (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: