Number theory
Date added
$4,855 bountynobody has started
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Even one lemma helps. When someone closes this problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-647Command line, then a pull request on GitHub.
Nothing has been published against this problem yet.
A first lemma counts as much as a last one: when the problem is closed, up to half of its bounty can go to the recognised pieces that led there.
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos647-erdos-647-a62f73c5b6bde7ff7bfe034a-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-647 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«647»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos647.erdos_647" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∃ n > 24, ⨆ m, ↑m + (ArithmeticFunction.sigma 0) ↑m ≤ n + 2Original conjecture source: FormalConjectures/ErdosProblems/647.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.