Erdős problem 205 · problems.science

Is it true that all sufficiently large $n$ can be written as $2^k+m$ for some $k\geq 0$ , where $\Omega(m)<\log\log m$ ? (Here $\Omega(m)$ is the number of prime divisors of $m$ counted with multiplicity.)

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/205.lean

Formal Conjectures

FormalConjectures/ErdosProblems/205.leanErdos205.erdos_205.parts.i1 lineExact file

1False ↔ ∀ᶠ (n : ℕ) in Filter.atTop, Erdos205.IsRepresentable (fun m => Real.log (Real.log ↑m)) n

SolvedStatement only, no proof

Proof manifests naming this Problem

Jayyhk Erdős Leanjayyhk:erdos:205
PLBY Lean proofsErdosProblems.Erdos205

Reported activity

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

AI standalone
Erdős AI contributions wiki · 10 Jan, 2026
Machine
Aristotle, GPT-5.2 Thinking
Open the source record
construction
VibeMathed
Machine
Aristotle, GPT-5.2 Thinking
Reported outcome
resolved
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Proof manifests naming this Problem

Reported activity

Continue

Search problems.science