ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let db(n)d_b(n) denote the number of dismal divisors of nn in base bb, and let nn range over the kk-digit base-bb numbers. Maximum-divisor conjecture. For every base b≥3b\geq 3, db(n)d_b(n) has a unique maximum at

n=bk−1b−1=111…1∣b.n=\frac{b^k-1}{b-1}=111\ldots1|_b.

The claim identifies the all-ones base-bb number as the unique kk-digit number with the most dismal divisors. The paper gives this as a conjecture after noting that these numbers come close to the general upper bound, and does not report a 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.