MathDB

Infinitely many super Carmichael numbers

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}.

Super Carmichael infinitude conjecture. There are infinitely many super Carmichael numbers. The source motivates this by heuristic estimates based on the abundance of Carmichael numbers.

Sources & referencesView supporting material

Primary source

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

carmichael-numbersprime-distribution

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.