Convex and discrete geometry
$4,996 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 finishes the problem, the pool splits between everyone whose work led there.
contrib new erdos-1085-variants-upper-d3Command line, then a pull request on GitHub.
1 piece · 55 lemmas
8 Sept 2026
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
pool/tier-1/erdos-1085-variants-upper-d3-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-1085-variants-upper-d3 →
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«1085»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1085.erdos_1085.variants.upper_d3" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ (fun n => ↑(Erdos1085.f 3 n)) =O[Filter.atTop] fun n => ↑n ^ (4 / 3) * Real.log (Real.log ↑n)Original conjecture source: FormalConjectures/ErdosProblems/1085.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.