Combinatorics
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-535Command line, then a pull request on GitHub.
1 piece · 6 lemmas
3 Sept 2026
Erdős 535: extremal witness and monotonicity API
5FqLp5…FfZZiK · 6 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos535-erdos-535-56682e5d1609cb3f64e5b1a6-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-535 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«535»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos535.erdos_535" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ r ≥ 3, ∃ c > 0, ∀ᶠ (N : ℕ) in Filter.atTop, ↑(Erdos535.f r N) ≤ ↑N ^ (c / Real.log (Real.log ↑N))Original conjecture source: FormalConjectures/ErdosProblems/535.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.