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 statement1 of 6

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

FormalConjectures/ErdosProblems/10.leanErdos10.erdos_101 lineExact file

1True ↔ ∃ k, Erdos10.sumPrimeAndTwoPows k = Set.univ \ {0, 1}

OpenStatement only, no proof