Number theory
Date added
$4,855 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 closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-263-parts-iCommand line, then a pull request on GitHub.
1 piece · 7 lemmas
23 Sept 2026
Bounded-tail case of 263(i): rational sum forces unbounded integer tails (Sylvester obstruction)
5H4Cpb…vjBPNo · 7 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-parts-i-5260d3ee0ad9c62f03bd21b7-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-263-parts-i →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«263»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos263.erdos_263.parts.i" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ Erdos263.IsIrrationalitySequence fun n => 2 ^ 2 ^ nOriginal conjecture source: FormalConjectures/ErdosProblems/263.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.