erdős #1096
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, ?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Assuming [[nomath]](as your notation $0=x_1<x_2<\cdots$ forces)[[/nomath]] that the exponents are **nonnegative integers**—i.e. you are looking at [ X(q):=\\{\sum_{i\in S} q^i:\ S\subset{0,1,2,\dots}\ \text{finite}\\}, ] and ((x_k)) is the increasing enumeration of $X(q)$,
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 11 · solved (literature)
theorem erdos_1096 :
answer(True) ↔ ∃ ε > 0, ∀ q, 1 < q → q < 1 + ε →
∀ x : ℕ → ℝ, StrictMono x → Set.range x = { ∑ i ∈ S, q ^ i | S : Finset ℕ } →
Tendsto (fun k => x (k + 1) - x k) atTop (𝓝 0)formal-conjectures/1096.lean ↗links
Pisot-Vijayaraghavan number · reference
1991 problem session · paper
status
solved