2000 character limit reached
On the differences between consecutive prime numbers, I
Published 14 Nov 2011 in math.NT | (1111.3380v2)
Abstract: We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect of a theorem of Gallagher that the prime $k$-tuple conjecture implies that the prime numbers are distributed in a Poisson distribution around their average spacing.
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.