ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s(n)s(n) denote the sum of the binary digits of nn. For k∈{14,15}k\in\{14,15\}, consider odd integers nn satisfying

s(n)=s(n2)=k.s(n)=s(n^2)=k.

Finiteness conjecture. Let k∈{14,15}k\in\{14,15\}. Then the number of odd integers nn with s(n)=s(n2)=ks(n)=s(n^2)=k is finite.

The conjecture extends the paper's finite-case analysis for k∈{9,10,11}k\in\{9,10,11\}. A global search found no infinite family for k=14k=14 or k=15k=15 below 2802^{80}, but finiteness for these values 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.