Number theory
Date added
$1,076 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«462»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos462.erdos_462" := by
sorry
end Bounty
Original conjecture (Lean type)
∃ C c,
0 < C ∧ 0 < c ∧ ∀ᶠ (x : ℕ) in Filter.atTop, c ≤ ∑ n ∈ Finset.Icc x ⌊↑x + C * √↑x * Real.log ↑x ^ 2⌋₊, ↑n.minFac / ↑nOriginal conjecture source: FormalConjectures/ErdosProblems/462.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
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.