Skip to content

Erdős problem 10

Is there some kk such that every integer is the sum of a prime and at most kk powers of 22?

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

10.lean

Retained formal statement2 of 6

Gallagher [Ga75] has shown that for any ϵ>0ϵ > 0 there exists k(ϵ)k(ϵ) such that the set of integers which are the sum of a prime and at most k(ϵ)k(ϵ) many powers of 22 has lower density at least 1−ϵ1 - ϵ.

Ref: Gallagher, P. X., _Primes and powers of 2_.

FormalConjectures/ErdosProblems/10.leanErdos10.erdos_10.variants.gallagher1 lineExact file
∀ (ε : ℝ), 0 < ε → ∃ k, 1 - ε ≤ (Erdos10.sumPrimeAndTwoPows k).lowerDensity
SolvedStatement only, no proof