Number theory
Date added
$5,226 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-68Command line, then a pull request on GitHub.
1 piece · 2 lemmas
1 Sept 2026
Factorial-residue criteria reducing Erdős 68 to a positive-side recurrence
5EyGbW…7GEFVR · 2 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos68-erdos-68-4658e2ede194562b858aea4e-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-68 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«68»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos68.erdos_68" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ Irrational (∑' (n : ℕ), 1 / (↑(n + 2).factorial - 1))Original conjecture source: FormalConjectures/ErdosProblems/68.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.