Number theory
Date added
$5,525 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-359-parts-iCommand line, then a pull request on GitHub.
1 piece · 9 lemmas
1 Sept 2026
The first eight terms of the greedy no-consecutive-sum sequence: 1, 2, 4, 5, 8, 10, 14, 15
5FqLp5…FfZZiK · 9 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-parts-i-0b07ee2cb740f18a5d123221-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-359-parts-i →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«359»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos359.erdos_359.parts.i" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (A : ℕ → ℕ), Erdos359.IsGoodFor A 1 → Filter.Tendsto (fun k => ↑(A k) / ↑k) Filter.atTop Filter.atTopOriginal conjecture source: FormalConjectures/ErdosProblems/359.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.