The coprime-order criterion for completeness
Statement
Let be an odd number not divisible by , with prime decomposition
Assume that the numbers are mutually prime.
Coprime-order completeness conjecture. Then is complete.
This is explicitly presented as a weaker conjecture than the preceding primitive-number conjecture. The supplied text does not state whether it has been proved or disproved.
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.