Erdős problem 10 · problems.science

Is there some $k$ such that every integer is the sum of a prime and at most $k$ powers of $2$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

6 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

10.lean

Retained formal statement3 of 6

Granville and Soundararajan [GrSo98] have conjectured that at most $3$ powers of $2$ suffice for all odd integers, and hence at most $4$ powers of $2$ suffice for all even integers.

Ref: Granville, A. and Soundararajan, K., _A Binary Additive Problem of Erdős and the Order of $2$ mod $p^2$ _

FormalConjectures/ErdosProblems/10.leanErdos10.erdos_10.variants.granville_soundararajan_odd1 lineExact file

1{n | Odd n ∧ 1 < n} ⊆ Erdos10.sumPrimeAndTwoPows 3 ∧ {n | Even n ∧ n ≠ 0} ⊆ Erdos10.sumPrimeAndTwoPows 4

OpenStatement only, no proof

Sources

Search problems.science