Refinement of the perfect-power repulsion conjecture for partition numbers
Statement
Let be the partition function, let be the distance from to the nearest th power, and let
Refinement of the perfect-power repulsion conjecture. If , then , and for every ,
The first assertion recapitulates Sun's conjecture, while the second gives a sub-polynomial upper bound on the last partition index within distance of a th power. It is presented as a numerical refinement and remains open.
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.