Is it true that for every lacunary, strongly complete sequence `A` that is not complete whenever
infinitely many terms are removed from it, `lim A (n + 1) / A n = (1 + √5) / 2`?
Actions
Submit a Proof
Have a proof attempt? Submit it for zero-trust verification.
theorem erdos_346 : answer(sorry) ↔ ∀ {A : ℕ → ℕ}, IsLacunary A → IsAddStronglyCompleteNatSeq A →
(∀ B : Set ℕ, B ⊆ range A → B.Infinite → ¬ IsAddComplete (range A \ B)) →
Tendsto (fun n => A (n + 1) / (A n : ℝ)) atTop (𝓝 ((1 + √5) / 2))
