ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p(n)p(n) denote the number of unrestricted integer partitions of nn, with p(0)=1p(0)=1. An integer is a perfect power if it has the form mkm^k with integers m≥2m\ge 2 and k≥2k\ge2. For fixed k≥2k\ge2, define the distance from p(n)p(n) to the nearest kkth power by

Δk(n):=min⁡m≥0∣p(n)−mk∣.\Delta_k(n):=\min_{m\ge0}|p(n)-m^k|.

Sun's perfect-power repulsion conjecture. The partition function p(n)p(n) repels perfect powers in the following senses: (i) for every n≥2n\ge2 and k≥2k\ge2, p(n)≠mkp(n)\neq m^k for all integers m≥2m\ge2; and (ii) for every k≥2k\ge2 and d≥0d\ge0, only finitely many nn satisfy Δk(n)≤d\Delta_k(n)\le d.

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 pB(n)p_B(n), rather than proving the stated claims for p(n)p(n) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.