Conjectural lower bound for the weighted divisor statistic v(n)
Statement
For a positive integer , define
Let be the smallest prime factor of . Lower-bound conjecture for . If
then
This would strengthen the proven bound for perfect numbers. The source presents the assertion as unresolved and does not explain the exceptional set beyond listing it.
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.