login
A070672
Smallest m in range 2..n-1 such that m^7 == 1 mod n, or 1 if no such number exists.
1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 7, 1, 1, 1, 1, 1
OFFSET
1,29
LINKS
MAPLE
a:= proc(n) local m;
for m from 2 to n-1 do
if m &^ 7 mod n = 1 then return m fi
od; 1
end:
seq(a(n), n=1..100); # Alois P. Heinz, Jun 29 2014
PROG
(PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^7) == 1, return (m)); ); return (1); } \\ Michel Marcus, Jun 29 2014
CROSSREFS
Cf. A070667.
Sequence in context: A249776 A348970 A053878 * A319101 A354487 A336699
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 08 2002
STATUS
approved