Combinatorics
Date added
c as above.
$1,024 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«80»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos80.erdos_80.parts.ii" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (c : ℝ), 0 < c → c < 1 / 2 → (fun n => Real.log ↑n) =O[Filter.atTop] fun n => ↑(Erdos80.f c n)Original conjecture source: FormalConjectures/ErdosProblems/80.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
References
FormalConjectures/ErdosProblems/600.leanSomething 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.