Number theory
limsup (fun n => (f n - 2 * n.nth Prime : ℕ∞)) atTop = ⊤? $5,103 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«454»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos454.erdos_454" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ Filter.limsup (fun n => ↑(Erdos454.f n) - 2 * ↑(Nat.nth Prime n)) Filter.atTop = ⊤Original conjecture source: FormalConjectures/ErdosProblems/454.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.