Erdős problem 1096
Let and consider the set of numbers of the shape (for all finite ), ordered by size as .
Sources
FormalConjectures/ErdosProblems/
1096.lean
Retained formal statement
Let and consider the set of numbers of the shape (for all finite ), ordered by size as .
Is it true that, provided is sufficiently small, ?
This was solved affirmatively by Erdős and Komornik [ErKo98], who proved the conclusion whenever , where is the second Pisot-Vijayaraghavan number.
True ↔ ∃ ε > 0, ∀ (q : ℝ), 1 < q → q < 1 + ε → ∀ (x : ℕ → ℝ), StrictMono x → Set.range x = {x | ∃ S, ∑ i ∈ S, q ^ i = x} → Filter.Tendsto (fun k => x (k + 1) - x k) Filter.atTop (nhds 0)SolvedStatement only, no proof