Number theory
$5,103 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«145»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos145.erdos_145" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ α ≥ 0,
∃ β,
Filter.Tendsto (fun x => 1 / x * ∑ n ∈ Erdos145.A x, (↑(Erdos145.s (n + 1)) - ↑(Erdos145.s n)) ^ α) Filter.atTop
(nhds β)Original conjecture source: FormalConjectures/ErdosProblems/145.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.