Cross-posting from Math.Stackexchange.

You might have read about the fortuitous meeting between Montgomery and Dyson. The background is that the nontrivial zeros of the Riemann zeta function, when normalized to have unit spacing on average, (seem to) have the pair correlation function $1-\mathrm{sinc}^2(x)$, where $\mathrm{sinc}$ is the normalized function $\sin(\pi x)/ (\pi x)$. It's still a conjecture but it has good numerical support.

So what about prime numbers? Let $\Sigma(x,u)$ be the number of pairs of primes $p,q\le x$ which satisfy the inequality $0\le p-q\le \frac{x}{\pi(x)}u$, where $\pi(x)$ is the prime counting function. This inequality is chosen because multiplying primes by $\frac{\pi(x)}{x}$ will ensure the gaps between consecutives is exactly unity (hence they are normalized). Then what might

$$g(u)=\frac{d}{du}\left(\lim_{x\to\infty}\frac{\Sigma(x,u)}{\pi(x)}\right)$$

end up looking like? This basically asks, "what is the density of normalized primes around so-and-so apart from each other?" (You can see the original Montgomery conjecture as equation 12 here. I've adapted it to prime numbers by essentially changing the asymptotic number of zeta zeros to the prime counting function instead. I might be acting presumptuous in assuming the naive replacement will still afford a meaningful answer.)