Let $A = \{a_1 0$, there exists some $k$ such that $F(A,X,k) < X^\epsilon$?

Erdős problem 873 · problems.science

Let $A = \{a_1 < a_2 < \dots\} \subseteq \mathbb{N}$ and let $F(A,X,k)$ count the number of $i$ such that $[a_i,a_{i+1}, \dots ,a_{i+k−1}] < X$ , where the left-hand side is the least common multiple. Is it true that, for every $\epsilon > 0$ , there exists some $k$ such that $F(A,X,k) < X^\epsilon$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/873.lean

Formal Conjectures

FormalConjectures/ErdosProblems/873.leanErdos873.erdos_8731 lineExact file

1True ↔ ∀ (a : ℕ → ℕ), ∀ ε > 0, 0 < a 0 → StrictMono a → ∃ k, ∀ X > 0, ↑↑(Erdos873.F a X k) < ↑(X ^ ε)

OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI collaborating with humans
Erdős AI contributions wiki · 30 Apr, 2026
Machine
GPT-5.5 Thinking
People
Ingo Althöfer
Open the source record
AI collaborating with humans
Erdős AI contributions wiki · 29 Apr, 2026
Machine
GPT-5.4 Thinking
People
Ritvik Nayak
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science