ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d2(n)d_2(n) denote the number of dismal divisors of nn, and let nn range over the odd kk-digit binary numbers. Odd-binary divisor-count conjecture. The unique maximum of d2(n)d_2(n) occurs at

n=2k−1=111…111∣2.n=2^k-1=111\ldots111|_2.

If k≥3k\geq 3 and k≠5k\neq 5, the second-largest value occurs at

n=2k−3=111…101∣2,n=2^k-3=111\ldots101|_2,

and

n=2k−2k−2−1=101…111∣2,n=2^k-2^{k-2}-1=101\ldots111|_2,

possibly together with other values of nn. This refines the preceding binary maximum conjecture by restricting to odd numbers and specifying candidates for the second-largest value; the paper gives no 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.