Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«890»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos890.erdos_890.parts.a" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ k ≥ 1, Filter.liminf (fun n => ∑ i ∈ Finset.range k, ↑(Erdos890.omegaGt k (n + i))) Filter.atTop ≤ ↑kOriginal conjecture source: FormalConjectures/ErdosProblems/890.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.