Erdős problem 11

Is every odd $n > 1$ the sum of a squarefree number and a power of 2?

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

11.lean

Retained formal statement5 of 6

Erdős often asked this under the weaker assumption that $n > 1$ is not divisible by 4.

FormalConjectures/ErdosProblems/11.leanErdos11.erdos_11.variants.not_four_dvd1 lineExact file

1∀ (n : ℕ), ¬4 ∣ n → 1 < n → ∃ k l, Squarefree k ∧ n = k + 2 ^ l

OpenStatement only, no proof