OFFSET
1,2
COMMENTS
Numbers k such that j^j == j^j^j (mod k) for every j. For k <= 16, we can compute membership directly (see Mathematica code). For k > 16, we have j = 2 as a counterexample. - Eric M. Schmidt, Aug 03 2014
LINKS
Sunil K. Chebolu and Michael Mayers, What is special about the divisors of 12?, Mathematics Magazine, 86 (2013), 143-146.
MATHEMATICA
h1[mod_] := Table[PowerMod[i, i, mod], {i, 1, mod + LCM[mod*CarmichaelLambda[mod]]}]; h2[mod_] := Table[PowerMod[i, i^i, mod], {i, 1, mod + LCM[mod*CarmichaelLambda[mod]]}]; Union[Table[If[h1[i] == h2[i], Print[i]; i], {i, 1000}]]
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
José María Grau Ribas, Jan 23 2012
EXTENSIONS
Renamed by Andrei Zabolotskii, May 13 2026
STATUS
approved
