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 68 Is
∑ n = 2 ∞ 1 n ! − 1 \sum_{n=2}^\infty \frac{1}{n!-1} n = 2 ∑ ∞ n ! − 1 1
irrational?
$2,690 bounty · 1 piece from 1 person· last one 19 days ago
week of 27 Sept 2025 · nothing published week of 4 Oct 2025 · nothing published week of 11 Oct 2025 · nothing published week of 18 Oct 2025 · nothing published week of 25 Oct 2025 · nothing published week of 1 Nov 2025 · nothing published
Solve it A complete proof or refutation in Lean. The first one the validator accepts takes the whole bounty.
Add a piece 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.
Command line, then a pull request on GitHub.
← Erdős problem 66 Erdős problem 70 - omega times two four → What has been built 1 piece · 2 lemmas
1 Sept 2026
Proof target
import FormalConjectures.ErdosProblems.«68»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos68.erdos_68" := by
sorry
end Bounty
Open this target’s Challenge.lean Original conjecture (Lean type)
True ↔ Irrational (∑' (n : ℕ), 1 / (↑(n + 2).factorial - 1))Original conjecture source: FormalConjectures/ErdosProblems/68.lean
Source type SHA-256 sha256:b59291e94988a84176901a9e18e915d3dbc5c298f47b3a6b0a6e3c57d8b815b6
Task id fc-8432eac9-erdos68-erdos-68-dcb57ba1aa-formalized-v1
Task commitment sha256:01ab0f9ab6b35f4b6c35506797cd2ab3839d526f40b21191132202106d69a708 week of 8 Nov 2025 · nothing published
week of 15 Nov 2025 · nothing published
week of 22 Nov 2025 · nothing published
week of 29 Nov 2025 · nothing published
week of 6 Dec 2025 · nothing published
week of 13 Dec 2025 · nothing published
week of 20 Dec 2025 · nothing published
week of 27 Dec 2025 · nothing published
week of 3 Jan 2026 · nothing published
week of 10 Jan 2026 · nothing published
week of 17 Jan 2026 · nothing published
week of 24 Jan 2026 · nothing published
week of 31 Jan 2026 · nothing published
week of 7 Feb 2026 · nothing published
week of 14 Feb 2026 · nothing published
week of 21 Feb 2026 · nothing published
week of 28 Feb 2026 · nothing published
week of 7 Mar 2026 · nothing published
week of 14 Mar 2026 · nothing published
week of 21 Mar 2026 · nothing published
week of 28 Mar 2026 · nothing published
week of 4 Apr 2026 · nothing published
week of 11 Apr 2026 · nothing published
week of 18 Apr 2026 · nothing published
week of 25 Apr 2026 · nothing published
week of 2 May 2026 · nothing published
week of 9 May 2026 · nothing published
week of 16 May 2026 · nothing published
week of 23 May 2026 · nothing published
week of 30 May 2026 · nothing published
week of 6 Jun 2026 · nothing published
week of 13 Jun 2026 · nothing published
week of 20 Jun 2026 · nothing published
week of 27 Jun 2026 · nothing published
week of 4 Jul 2026 · nothing published
week of 11 Jul 2026 · nothing published
week of 18 Jul 2026 · nothing published
week of 25 Jul 2026 · nothing published
week of 1 Aug 2026 · nothing published
week of 8 Aug 2026 · nothing published
week of 15 Aug 2026 · nothing published
week of 22 Aug 2026 · nothing published
week of 29 Aug 2026 · 1 piece published
week of 5 Sept 2026 · nothing published
week of 12 Sept 2026 · nothing published
week of 19 Sept 2026 · nothing published
27 Sept 2025 a year of work on this problem 19 Sept 2026
erdosproblems.com/68
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.
Reward
$2,690
for closing this problem
Whoever closes it takes the bounty. Published pieces that helped get there share a separate contribution pool, paid out once the problem is closed.
Set by bounty policy linear-age-v3-locked: 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.
Prove it or break it
The same problem accepts both. You can submit a proof of the statement or a counterexample that refutes it, and you choose which when you submit.
Prove the statement no attempts
Find a counterexample no attempts
Erdős problem 68 · Conjectures.io