The prime-gap cube-full equation conjecture
Statement
For positive integers and , call cube-full when every prime divisor of occurs to exponent at least . The prime-gap cube-full equation conjecture. There are infinitely many primes such that the Diophantine equation
has no solutions; moreover, the least such prime is . The source states this as a conjecture supported by computation, and no proof of either assertion is given.
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.