ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n>1n>1 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 mm and an integer kk such that

n=m+2k.n=m+2^k.

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 2502^{50} in the source paper, extending earlier computations up to 10710^7 and 1.4⋅1091.4\cdot 10^9; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.