Marques–Trojovský conjecture on the Bonse inequality threshold function
Statement
Let denote the -th prime, let be the prime-counting function, and for define
For , let be the minimum, when it exists, of the integers such that
Marques–Trojovský conjecture. The function satisfies: (i) for all ; (ii) for all ; (iii) for all ; (iv) ; and (v) . These values refine the known piecewise-constant behavior of the threshold function and provide explicit numerical information about continuous Bonse-type inequalities; the source does not state whether the conjecture has been resolved.
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.