Convex and discrete geometry
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
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.