Residue Class Patterns of Consecutive Primes

Abstract

For m,q ∈ N, we call an m-tuple (a1,…,am) ∈ Πi=1m (Z/qZ)× good if there are infinitely many consecutive primes p1,…,pm satisfying pi ai q for all i. We show that given any m sufficiently large, q squarefree, and A ⊂eq (Z/qZ)× with |A|= 71( m)3 , we can form at least one non-constant good m-tuple (a1,…,am) ∈ Πi=1m 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 (q) ( 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…