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

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

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

1∀ (n : ℕ), Odd n → 1 < n → ∃ k l m, Squarefree k ∧ n = k + 2 ^ l + 2 ^ m

OpenStatement only, no proof