The board / number theory / #779
Erdős Problem #779
FALSIFIABLEdatabase updated 2025-08-31
Still open — but if it is false, a finite counterexample exists, so a computer search could in principle disprove it. A search can't prove it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsnumber theory, primes
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA005235
Original pageerdosproblems.com/779
Attempts
submit one →Read our working report →
proved the exact Cramér-window/tail decomposition, APRCL-reverified witnesses for 2<=n<=100, and BPSW-checked (not proved) the n=3001 candidate; the uniform prime-gap/prime-pair step remains open.
PARTIAL