No odd prime power is super Carmichael

At least 12 years old · documented by

A super Carmichael number is a weak Carmichael number satisfying

∑1≤k≤n−1gcd⁡(k,n)=1kn−1≡φ(n)(modn2).\sum_{\substack{1\le k\le n-1\gcd(k,n)=1}}k^{n-1}\equiv\varphi(n)\pmod{n^2}.

No odd prime-power super Carmichael conjecture. For every odd prime pp and every f≥2f\ge 2, the prime power pfp^f is not a super Carmichael number. The source gives a Bernoulli-number characterization for p>3p>3, but no resolution of the conjecture.

References

Primary source

Romeo Meštrović, “Generalizations of Carmichael numbers I”, arXiv:1305.1867 (2013).

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.