Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«323»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos323.erdos_323.parts.ii" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ (k m : ℕ), 1 ≤ m → m < k → (fun x => ↑x ^ (↑m / ↑k)) =O[Filter.atTop] fun x => ↑(Erdos323.f k m x)Original conjecture source: FormalConjectures/ErdosProblems/323.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.