Number theory
1 < a 0 < ... has property Erdos951Prop, is it true that #{a i ≤ x} ≤ π x? Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«951»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos951.erdos_951" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ (a : ℕ → ℝ),
1 < a 0 →
StrictMono a → Erdos951.Erdos951Prop a → ∀ᶠ (x : ℝ) in Filter.atTop, {i | a i ≤ x}.ncard ≤ ⌊x⌋₊.primeCountingOriginal conjecture source: FormalConjectures/ErdosProblems/951.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.