2000 character limit reached
Almost primes in almost all very short intervals
Published 21 Dec 2020 in math.NT | (2012.11565v3)
Abstract: We show that as soon as $h\to \infty$ with $X \to \infty$, almost all intervals $(x-h\log X, x]$ with $x \in (X/2, X]$ contain a product of at most two primes. In the proof we use Richert's weighted sieve, with the arithmetic information eventually coming from results of Deshouillers and Iwaniec on averages of Kloosterman sums.
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.