erdős #125
Let be the set of integers which have only the digits when written base , and be the set of integers which have only the digits when written base . Does have positive lower density?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
machinery: base-representations,additive-combinatorics,sumset-density,digit-restricted-sets,consecutive-integer-window,covering-system
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
alphaproof · AlphaProof Nexus (DeepMind) · machine-verified (Lean)
Machine-verified Lean proof (kernel-checkable, sorry-free).
Lean proof ↗unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
If you write [ C=A+B=\Big{\sum \epsilon_k3^k+\sum \eta_j4^j:\epsilon_k,\eta_j\in{0,1}\Big}, ] then the question is whether (C) has **positive (lower) asymptotic density**, i.e. whether [ \liminf_{x\to\infty}\frac{|C\cap[1,x]|}{x}>0. ] This is an old problem of Burr–Erdős–Graham–Li / Erdős, and it is still listed as ope…
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_125 :
answer(False) ↔ (A + B).HasPosDensityformal-conjectures/125.lean ↗Kernel-checked proof; human-attested statement.
- variant — reviewer:will-blair
erdos_125.variants.positive_lower_density.lean
oeis
links
improved this argument · link
status
solved