The coprime-order criterion for completeness
The coprime-order criterion for completeness
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.
Sources & referencesView supporting material
Primary source
Dorin Ervin Dutkay and John Haussermann, “Number theory problems from the harmonic analysis of a fractal”, arXiv:1410.7064 (2015).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.