Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«400»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos400.erdos_400.parts.i" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ k ≥ 2,
∃ c,
Asymptotics.IsEquivalent Filter.atTop (fun x => ∑ n ∈ Finset.Icc 1 x, ↑(Erdos400.g k n)) fun x =>
c * ↑x * Real.log ↑xOriginal conjecture source: FormalConjectures/ErdosProblems/400.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.