Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On smooth gaps between primes using the Maynard-Tao sieve (2403.19696v3)

Published 20 Mar 2024 in math.NT

Abstract: In 1999, Balog, Br\"udern, and Wooley (1999) showed there are infinitely many prime gaps $p-q$ that are $(\log p){\frac{3}{4}}$-smooth, and infinitely many consecutive prime gaps that are $(\log p)\frac{7}{8}$-smooth. Advancements made since then by Zhang (2014), Maynard (2014), and Polymath8b (2014) towards resolving the twin prime conjecture have given us the tools to lower the bounds made by Balog, Br\"udern, and Wooley to 47. Moreover, we can show there are infinitely many $m$-tuples of primes whose gaps are all $y_m$-smooth for a calculable prime $y_m$.

Summary

We haven't generated a summary for this paper yet.