The coprime-order criterion for completeness

Let mm be an odd number not divisible by 33, with prime decomposition

m=p1k1prkr.m=p_1^{k_1}\dots p_r^{k_r}.

Assume that the numbers o4(p1),,o4(pr),p1,,pro_4(p_1),\dots,o_4(p_r),p_1,\dots,p_r are mutually prime.

Coprime-order completeness conjecture. Then mm 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

No solutions have been posted yet.