Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 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

Small gaps between almost-twin primes (2402.00748v1)

Published 1 Feb 2024 in math.NT

Abstract: Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that [ q_{m+1}-q_{1}=O(e{7.63m}) ] and $q_{j}+2$ has at most [ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21 ] prime factors for each $1 \leq j \leq m+1$. This improves the previous result of Li and Pan, replacing $e{7.63m}$ by $m{4}e{8m}$ and $\frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21$ by $\frac{16m}{\log 2} + \frac{5\log m}{\log 2} + 37$. The main inputs are the Maynard-Tao sieve, a minorant for the indicator function of the primes constructed by Baker and Irving, for which a stronger equidistribution theorem in arithmatic progressions to smooth moduli is applicable, and Tao's approach previously used to estimate $\sum_{x \leq n < 2x} \mathbf{1}{\mathbb{P}}(n)\mathbf{1}{\mathbb{P}}(n+12)\omega_{n}$, where $\mathbf{1}{\mathbb{P}}$ stands for the characteristic function of the primes and $\omega{n}$ are multidimensional sieve weights.

Summary

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