ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d2(n)d_2(n) denote the number of dismal divisors of the kk-digit binary number nn. Binary maximum-divisor conjecture. Among all kk-digit numbers, the maximal value of d2(n)d_2(n) occurs at

n=2k−2=111…10∣2,n=2^k-2=111\ldots10|_2,

and this is the unique maximum except when n=2n=2 or n=4n=4. The conjecture is the binary counterpart of the preceding maximum-divisor claim, with explicit exceptional cases. The paper states it without a proof or resolution.

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.