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.)

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#205
→
ResultNone
→
Checks0

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

Reported activity

Search problems.science