|
|
A070673
|
|
Smallest m in range 2..n-1 such that m^8 == 1 mod n, or 1 if no such number exists.
|
|
1
|
|
|
1, 1, 2, 3, 2, 5, 6, 3, 8, 3, 10, 5, 5, 13, 2, 3, 2, 17, 18, 3, 8, 21, 22, 5, 7, 5, 26, 13, 12, 7, 30, 3, 10, 9, 6, 17, 6, 37, 5, 3, 3, 13, 42, 21, 8, 45, 46, 5, 48, 7, 2, 5, 23, 53, 12, 13, 20, 17, 58, 7, 11, 61, 8, 7, 8, 23, 66, 9, 22, 13, 70, 17, 10, 31, 7, 37
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MAPLE
|
a:= proc(n) local m;
for m from 2 to n-1 do
if m &^ 8 mod n = 1 then return m fi
od; 1
end:
|
|
MATHEMATICA
|
a[n_] := Module[{m}, For[m = 2, m <= n-1, m++,
If[PowerMod[m, 8, n] == 1, Return[m]]]; 1];
|
|
PROG
|
(PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^8) == 1, return (m)); ); return (1); } \\ Michel Marcus, Jun 29 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|