The maximum number of dismal divisors in base b
Statement
Let denote the number of dismal divisors of in base , and let range over the -digit base- numbers. Maximum-divisor conjecture. For every base , has a unique maximum at
The claim identifies the all-ones base- number as the unique -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.