Erdős's squarefree-plus-power-of-two conjecture
Statement
Let be an odd integer. A squarefree integer is an integer not divisible by the square of any prime.
Erdős's conjecture. There exist a squarefree integer and an integer such that
The conjecture concerns representing every odd integer greater than one as the sum of a squarefree integer and a power of two. It has been verified numerically for all odd integers up to in the source paper, extending earlier computations up to and ; a general proof remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.