The two largest dismal-divisor counts among odd binary numbers
Statement
Let denote the number of dismal divisors of , and let range over the odd -digit binary numbers. Odd-binary divisor-count conjecture. The unique maximum of occurs at
If and , the second-largest value occurs at
and
possibly together with other values of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.