A231562 Numbers n such that A031971(8490421583559688410706771261086*n) == n (mod 8490421583559688410706771261086*n).
39607528021345872635, 118822584064037617905, 198037640106729363175, 356467752192112853715, 435682808234804598985, 514897864277496344255, 594112920320188089525, 673327976362879834795, 752543032405571580065, 910973144490955070605, 990188200533646815875
Offset: 1
Keywords
Links
- Jose María Grau, A. M. Oller-Marcen, and J. Sondow, On the congruence 1^n + 2^n +... + n^n = d (mod n), where d divides n
Crossrefs
Programs
-
Mathematica
fa = FactorInteger; Car[k_, n_] := Mod[n - Sum[If[IntegerQ[k/(fa[n][[i, 1]] - 1)], n/fa[n][[i,1]], 0], {i, 1, Length[fa[n]]}], n]; supercar[k_, n_] := If[k == 1 || Mod[k, 2] == 0 || Mod[n, 4] > 0, Car[k, n], Mod[Car[k, n] - n/2,]]; Select[39607528021345872635*Range[15],supercar[8490421583559688410706771261086*#, 8490421583559688410706771261086*#] == # &]
Comments