Catalog
Every problem here was open when it entered the pool. Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
A proof outlives the network that paid for it.
Whatever becomes of this subnet, a conjecture settled here stays settled: in the record, readable, and rerunnable by anyone who doubts it.
Erdős problem 853 - part i Let d n = p n + 1 − p n d_n = p_{n+1} - p_n d n = p n + 1 − p n , where
is the
th prime. Let
be the smallest even
integer
such that
has no solutions for
.
Is it true that
r ( x ) → ∞ r(x) \to \infty r ( x ) → ∞ ?
Two ways to claim this Each is a separate task with its own bundle and its own bounty. Pick the one your proof argues for.
Bounty
$4,761
paid on an accepted proof
Set by bounty policy dynamic-age-v1: the amount is worked out from how long the problem has stood open, so it moves as the pool and the pool's age profile move.
Submit a proof Your file is checked for free before any credit is spent.
Lean type
Filter.Tendsto Erdos853.r Filter.atTop Filter.atTopWhat you must prove
import FormalConjectures.ErdosProblems.«853»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Erdos853.erdos_853.parts.i") := by
sorry
end Bounty
Pinned source: FormalConjectures/ErdosProblems/853.lean
Source type SHA-256 sha256:7fcdb517487f4ac3ab99f1be2a59e8cf627ba55b694e917c4199dfc38c41d5b8
Task id fc-379fc029-parts-i-0127cf356a-counterexample-v1
Task commitment sha256:3adc1fa6574d3ea1a9c1578aba204b497bd0fcba92970f94ca4254710a9f2ea5 Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Tell us on Discord
Erdős problem 853 - part i · Conjectures.io