Subpolynomial growth of the last near-kth-power index

Prove that for every integer k > 1 and every real ε > 0, the quantity M_k(d) = max{n : A_k(n) ≤ d} satisfies M_k(d) = o(d^ε) as d tends to infinity, together with the asserted identity M_k(0) = 1.

Background

The function M_k(d) records the largest index n for which p(n) lies within distance d of a kth power. Conjecture 1 would imply that this maximum is finite for each fixed d.

Conjecture 2 refines the finiteness claim by predicting extremely slow growth in d: M_k(d) should be bounded by every positive power of d. Its first part is equivalent to Sun’s conjecture at d = 0.

References

Conjecture 2. If k > 1, then the following are true. (1) We have that M_k(0) = 1. (2) For every ε > 0, we have that M_k(d) = o(dε).

Do perfect powers repel partition numbers?  (2501.03754 - Merca et al., 7 Jan 2025) in Section “Further Conjectures: Do kth Powers Repel Partition Numbers?”, Conjecture 2