For , we call an -tuple good if there are infinitely many consecutive primes satisfying for all . We show that given any sufficiently large, squarefree, and with , we can form at least one non-constant good -tuple . Using this, we can provide a lower bound for the number of residue class patterns attainable by consecutive primes, and for large and 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 -th moment, where is an integer depending on .

生成讲解博客的中文版本

生成AI智能校验的中文版本