Papers
Topics
Authors
Recent
Search
2000 character limit reached

On smooth gaps between primes using the Maynard-Tao sieve

Published 20 Mar 2024 in math.NT | (2403.19696v3)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.