Erdős problem 851 · problems.science

Let $\epsilon > 0$ . Is there some $r \ll_\epsilon 1$ such that the density of integers of the form $2^k+n$ , where $k \geq 0$ and $n$ has at most $r$ prime divisors, is at least $1-\epsilon$ ?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/851.lean

Formal Conjectures

FormalConjectures/ErdosProblems/851.leanErdos851.erdos_8511 lineExact file

1∀ ε ∈ Set.Ioo 0 1, ∃ r d, (Erdos851.TwoPowAddSet r).HasDensity d ∧ 1 - ε ≤ d

SolvedStatement only, no proof

Reported activity

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

AI alongside literature
Erdős AI contributions wiki · Feb 5, 2026
Machine
GPT-5.2 Pro
Open the source record
argument
VibeMathed
Machine
GPT-5.2 Pro
Reported outcome
resolved
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