Sun's perfect-power repulsion conjecture for the partition function
Statement
Let denote the number of unrestricted integer partitions of , with . An integer is a perfect power if it has the form with integers and . For fixed , define the distance from to the nearest th power by
Sun's perfect-power repulsion conjecture. The partition function repels perfect powers in the following senses: (i) for every and , for all integers ; and (ii) for every and , only finitely many satisfy .
The first assertion is Sun's original no-perfect-powers conjecture, while the second is the stronger perfect-power repulsion conjecture developed with later generalizations by Merca et al. The paper supports these conjectures through analogous finiteness results for restricted partition functions , rather than proving the stated claims for itself.
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.