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 ii 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 ) / log x → ∞ r(x) / \log x \to \infty r ( x ) / log 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 (fun n => ↑(Erdos853.r n) / Real.log ↑n) Filter.atTop Filter.atTopWhat you must prove
import FormalConjectures.ErdosProblems.«853»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Erdos853.erdos_853.parts.ii") := by
sorry
end Bounty
Pinned source: FormalConjectures/ErdosProblems/853.lean
Source type SHA-256 sha256:7776fd0ac25eb78df9afe93ad275affad847fa04be7d90471198cfe2ab066e46
Task id fc-379fc029-parts-ii-d187c46e3a-counterexample-v1
Task commitment sha256:e0d3e1b96cf2f6e996061bc48d11c05285b313fb3025f2b3202c5439c9714d93 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 ii · Conjectures.io