2000 character limit reached
Short intervals with a given number of primes
Published 1 Aug 2015 in math.NT | (1508.00143v1)
Abstract: A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is asymptotically equal to $\lambdame{-\lambda}/m!$ as $x$ tends to infinity. We show that the number of such $n$ is at least $x{1 - o(1)}$.
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.