Erdős problem 10

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

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

Open selected source

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

Source providers

Erdős Problems1
locator only
Formal Conjectures6
statement retained
VibeMathed0
not observed here
PLBY Lean proofs0
not observed here
Jayyhk Erdős Lean0
not observed here
William Blair Lean proofs0
not observed here
Erdős AI contributions wiki0
not observed here
GPT-Erdős0
not observed here

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 10.lean6