ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p(n)p(n) be the partition function, let Δk(n)\Delta_k(n) be the distance from p(n)p(n) to the nearest kkth power, and let

Mk(d):=max⁡{n:Δk(n)≤d}.M_k(d):=\max\left\{n:\Delta_k(n)\leq d\right\}.

Refinement of the perfect-power repulsion conjecture. If k>1k>1, then Mk(0)=1M_k(0)=1, and for every ε>0\varepsilon>0,

Mk(d)=o(dε).M_k(d)=o\left(d^{\varepsilon}\right).

The first assertion recapitulates Sun's conjecture, while the second gives a sub-polynomial upper bound on the last partition index within distance dd of a kkth 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 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.