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

Bogdan Grechuk has observed that $1117175146$ is not the sum of a prime and at most $3$ powers of $2$ , and pointed out that parity considerations, coupled with the fact that there are many integers not the sum of a prime and $2$ powers of $2$ suggest that there exist infinitely many even integers which are not the sum of a prime and at most $3$ powers of $2$ ).

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

1({n | Even n} \ Erdos10.sumPrimeAndTwoPows 3).Infinite

OpenStatement only, no proof

Sources

Search problems.science