Merca–Ono–Tsai stabilization conjecture for partition numbers
Statement
For each fixed integer , define
and let be the largest for which is within of a th power. Merca–Ono–Tsai's stabilization conjecture. There is a positive integer such that for all ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.