arXiv Analytics

Sign in

arXiv:2409.12819 [math.NT]AbstractReferencesReviewsResources

Residue Class Patterns of Consecutive Primes

Cheuk Fung Lau

Published 2024-09-19Version 1

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We show that given any $m$ sufficiently large, $q$ squarefree, and $A \subseteq (\mathbb{Z}/q\mathbb{Z})^\times$ with $|A|=\lfloor 71(\log m)^3 \rfloor$, we can form at least one non-constant good $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m A$. Using this, we can provide a lower bound for the number of residue class patterns attainable by consecutive primes, and for $m$ large and $\varphi(q) \gg (\log m)^{10}$ this improves on the lower bound obtained from direct applications of Shiu (2000) and Dirichlet (1837). The main method is modifying the Maynard-Tao sieve found in Banks, Freiberg, and Maynard (2015), where instead of considering the 2nd moment we considered the $r$-th moment, where $r$ is an integer depending on $m$.

Related articles: Most relevant | Search more
arXiv:1803.03377 [math.NT] (Published 2018-03-09)
On the sum of the reciprocals of the differences between consecutive primes
arXiv:1311.7003 [math.NT] (Published 2013-11-27, updated 2014-10-19)
Consecutive primes in tuples
arXiv:0910.2960 [math.NT] (Published 2009-10-15, updated 2011-03-02)
Jumping champions and gaps between consecutive primes