Cîmpeanu's Conjecture: Computational Evidence for Finiteness of Prime Gaps Exceeding √pₙ

Zenodo (CERN European Organization for Nuclear Research) 2026 Open access

Read full text
Authors: Gheorghe Robert Cîmpeanu
DOI: 10.5281/zenodo.18209992
Cited by: 0

Abstract

Proof-of-concept for Cîmpeanu's Conjecture: Exactly six consecutive prime pairs (pₙ, pₙ₊₁) have gₙ > √pₙ. Full computational verification for pₙ ≤ 2.04×10

Fields of Study & Subjects

Analytic Number Theory Research Limits and Structures in Graph Theory Advanced Mathematical Theories and Applications

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
10 January 2026