Odlyzko–Rubinstein–Wolf conjecture on the divisibility of jumping champions

About 17 years old · traced to

Let pnp_n denote the nn-th prime. For x>0x>0 and an integer dd, define

N(x,d)=∑pn+1≤x\pn+1−pn=d1,N(x,d)=\sum_{\substack{p_{n+1}\leq x\p_{n+1}-p_n=d}}1,

and let N∗(x)=max⁡dN(x,d)N^*(x)=\max_d N(x,d). The integers dd for which N(x,d)=N∗(x)N(x,d)=N^*(x) are called jumping champions.

Odlyzko–Rubinstein–Wolf conjecture. The jumping champions tend to infinity. Furthermore, any fixed prime pp divides all sufficiently large jumping champions.

This conjecture predicts the eventual arithmetic structure of the most common consecutive-prime gaps; the source presents it as one of two conjectures formulated from heuristic arguments and numerical evidence.

References

Primary source

Libo Wu and Xiaosheng Wu, “The k-tuple Prime Difference Champion”, arXiv:1710.10942 (2018).

Additional references

3 papers in this index state this conjecture (2009–2017). The statement above is taken from the most recent of them; the others are arXiv:1108.3680, arXiv:0910.2960.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.