A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Positive lower density of large prime gaps
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Color the Plane <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:primes, fractions, patience Levels:1
Category:Number theory Lean version:YES! ✔
Rate this game! 4.9 out of 5 (726 votes)

>>> How to Play <<<
Positive lower density of large prime gaps. For every fixed C > 0, a positive proportion of consecutive prime gaps exceed $C\log p_n$, throughout every sufficiently large initial segment of the primes. The proportion may depend on C. Consequently, the indices where $p_n/n$ increases have positive lower density, answering Erdős and Prachar.

>>> Level Select <<<
released 2026-09-25  |  1 theorem · 5 lemmas · 11 proofs · 7,213 words  |  PLAY LEVEL 1 »  (pdf)
For every fixed C > 0, we prove that a positive proportion of consecutive prime gaps exceed $C\log p$, where p is the smaller prime. The proportion is bounded below for every sufficiently large initial segment of the prime sequence, with a constant depending on C. It follows that the indices at which $p_n/n$ increases have positive lower asymptotic density, answering a question of Erdős and Prachar.

More Number theory Games!
Erdős’s short Egyptian-fraction conjecture PLAYABLE!Integral density on curve character varietiesThe Gaussian moat conjecture PLAYABLE!Artin's primitive root conjecture: infinitude for every base HOT!
Modularity over imaginary quadratic fieldsUchida's conjecture for open Galois homomorphismsMilne's rationality conjectureThe full Birch–Swinnerton-Dyer formula in Selmer coranks zero and one HOT!

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games