Number theory
Date added
$5,162 bounty1 piece from 1 personlast one 2 months ago
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 closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-1135Command line, then a pull request on GitHub.
1 piece · 26 lemmas
2 Sept 2026
Erdős 1135 (Collatz): shortcut-map API and a mod-16 descent reduction of the target
5FqLp5…FfZZiK · 26 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos1135-erdos-1135-8fcbd9953de6414c35d70447-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-1135 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«1135»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1135.erdos_1135" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ n > 0, ∃ m, CollatzConjecture.collatzStep^[m] n = 1Original conjecture source: FormalConjectures/ErdosProblems/1135.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.