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-357-variants-monotone-parts-iCommand line, then a pull request on GitHub.
1 piece · 3 lemmas
5 Sept 2026
Monotone reduction: h(n) = f(n) via distinct sums imply strict monotonicity
5C7yAA…aPkUfr · 3 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-parts-i-a2a2b347a16412b13519e3f2-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-357-variants-monotone-parts-i →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«357»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos357.erdos_357.variants.monotone.parts.i" := by
sorry
end Bounty
Original conjecture (Lean type)
(fun n => ↑(Erdos357.h n)) =o[Filter.atTop] fun n => ↑nOriginal conjecture source: FormalConjectures/ErdosProblems/357.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
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.