Number theory
$5,089 bounty1 piece from 1 personlast one last month
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
A lemma, a definition, a special case. There is no race: when someone finishes the problem, the pool splits between everyone whose work led there.
contrib new erdos-463Command line, then a pull request on GitHub.
1 piece · 11 lemmas
9 Sept 2026
Erdos 463 <=> reach(n)->inf; reach unbounded; deepest hole reach(267380)=3 certified
5GeGrY…uLUScV · 11 lemmas
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«463»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos463.erdos_463" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∃ f,
∃ (_ : Filter.Tendsto f Filter.atTop Filter.atTop),
∀ᶠ (n : ℕ) in Filter.atTop, ∃ m, m.Composite ∧ n + f n < m ∧ m < n + m.minFacOriginal conjecture source: FormalConjectures/ErdosProblems/463.lean
References
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.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.