2000 character limit reached
Twins almost prime under a Elliott-Halberstam's conjecture
Published 15 Jul 2019 in math.NT | (1907.06393v1)
Abstract: We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all $\varepsilon>0$, $p-2$ is either a prime number or can be written as $p_1 p_2$ where $p_1$ and $p_2$ are prime and $p_1<X{\varepsilon}$, and we give the explicit asymptotic.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.