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 385 - part i Let F ( n ) : = max { m + p ( m ) ∣ m < n composite } } F(n) := \max\{m + p(m) \mid \textrm{$m < n$ composite}\}\} F ( n ) := max { m + p ( m ) ∣ m < n composite }} where p ( m ) p(m) p ( m ) is the least
prime divisor of
. Is it true that
for all sufficiently large
?
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,732
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
True ↔ ∀ᶠ (n : ℕ) in Filter.atTop, n < Erdos385.F nWhat you must prove
import FormalConjectures.ErdosProblems.«385»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos385.erdos_385.parts.i" := by
sorry
end Bounty
Pinned source: FormalConjectures/ErdosProblems/385.lean
Source type SHA-256 sha256:e0a15490e63d4ef5f148aac31e5734af8e484c8c66e63270c3eeb400885c8839
Task id fc-379fc029-parts-i-f199e388e7-formalized-v1
Task commitment sha256:4625ebfe5b6e2abc11da48b3aec7a3cd9bd364f4c357d255abe784e53180cc3a 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 385 - part i · Conjectures.io