Most Common Difference Between Two Consecutive Primes? The question is as stated in the title. I was given this interesting problem by a friend of mine, but I don't know how to proceed with a solution. The immediate thought I had was that the most common difference is 2 since all primes are odd (except 2), but that seems trivial and silly. Any thoughts/hints/suggestions on how to find the most common difference? I suspect it has something to do with modular arithmetic but I'm not too sure.
Any and all help is appreciated :)
Thanks for reading,
A
Edit: To specify the term "most common," I mean to ask what is the most abundant or frequently occurring difference between two consecutive primes.

From the PNT, the average prime gap around $n$ is $\sim\log n$, therefore the quantity you're interested in can't be bounded above. You can also take a glance on Marek Wolf's work about "jumping champions", which correspond to the most frequent prime gaps in a finite range, and which are conjectured to be the primorials, $2, 6, 30, 210...$. It is indeed related to modular arithmetic, since those numbers are in some sense "like $0$" as far as distance between primes is concerned. See also my question untitled "About Goldbach's conjecture" on Mathoverflow, or my blog ideasfornumbertheory.com for further insights, though expressed in an unrigorous fashion.
