Skip to content

Erdős problem 851

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

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

851.lean

Retained formal statement2 of 2

The set of integers of the form 2^k+p (where p is prime) has positive lower density.

Formalisation note: here we also allow p = 1 since this simplifies the code and is equivalent to the original statement.

FormalConjectures/ErdosProblems/851.leanErdos851.erdos_851.variants.romanoff1 lineExact file
0 < (Erdos851.TwoPowAddSet 1).lowerDensity
SolvedStatement only, no proof