ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each fixed integer d≥0d\geq 0, define

L(d):=max⁡{n:p(n)≤d+1},L(d):=\max\{n:p(n)\leq d+1\},

and let Mk(d)M_k(d) be the largest nn for which p(n)p(n) is within dd of a kkth power. Merca–Ono–Tsai's stabilization conjecture. There is a positive integer NdN_d such that for all k≥Ndk\geq N_d,

Mk(d)=L(d).M_k(d)=L(d).

The source attributes this to Merca–Ono–Tsai and gives no proof or resolution.

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.