Erdős problem 967
Let be a sequence of integers such that . Is it true that, for every ,
Sources
FormalConjectures/ErdosProblems/
967.lean
Retained formal statement
Their interest in this problem arose from their proof that the statement that there are no such zeros is equivalent to the fact that, for any non-decreasing which is bounded on every bounded interval and is for , the relationship implies .
∀ (a : ℕ → ℕ), StrictMono a → 1 < a 0 → (Summable fun k => 1 / ↑(a k)) → ((∀ (t : ℝ), 1 + ∑' (k : ℕ), Erdos967.summand t (a k) ≠ 0) ↔ ∀ (f : ℝ → ℝ), Monotone f → (∀ (x : ℝ), 0 ≤ f x) → (∀ x < 1, f x = 0) → (∀ (x y : ℝ), BddAbove (f '' Set.Icc x y)) → Filter.Tendsto (fun x => (f x + ∑' (k : ℕ), f (x / ↑(a k))) / x) Filter.atTop (nhds (1 + ∑' (k : ℕ), 1 / ↑(a k))) → Filter.Tendsto (fun x => f x / x) Filter.atTop (nhds 1))SolvedStatement only, no proof