ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b≥3b\geq 3 and let nn range over the kk-digit numbers in base bb. Write db(n)d_b(n) for the number of lunar divisors of nn in base bb, and write 111…1∣b111\ldots 1|_b for the base-bb number with kk digits all equal to 11. Le Brun et al.'s conjecture. Among all such nn, 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\ldots 1|_b.

This is a conjecture about the extremal behavior of lunar divisors; the supplied text later states and proves the equivalent result, so it is solved.

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.