Large gaps between primes in arithmetic progressions -- an empirical approach
Martin Raab

TL;DR
This paper presents extensive computational results on the sizes of gaps between primes in arithmetic progressions and reports new findings on the largest known least primes in such progressions.
Contribution
It provides the first comprehensive empirical data on prime gaps in arithmetic progressions and introduces new large-scale numerical results.
Findings
New data on prime gaps in arithmetic progressions.
Identification of exceptionally large least primes in progressions.
Extensive computational verification of prime distribution patterns.
Abstract
An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.
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 · History and Theory of Mathematics
