[go: up one dir, main page]

login
A070675
Smallest m in range 2..n-1 such that m^10 == 1 mod n, or 1 if no such number exists.
11
1, 1, 2, 3, 4, 5, 6, 3, 8, 9, 2, 5, 12, 13, 4, 7, 16, 17, 18, 9, 8, 3, 22, 5, 4, 25, 26, 13, 28, 11, 2, 15, 2, 33, 6, 17, 36, 37, 14, 9, 4, 13, 42, 3, 19, 45, 46, 7, 48, 9, 16, 25, 52, 53, 4, 13, 20, 57, 58, 11, 3, 15, 8, 31, 14, 5, 66, 33, 22, 29, 5, 17, 72, 73
OFFSET
1,3
LINKS
MAPLE
a:= proc(n) local m;
for m from 2 to n-1 do
if m &^ 10 mod n = 1 then return m fi
od; 1
end:
seq(a(n), n=1..100); # Alois P. Heinz, Jun 29 2014
MATHEMATICA
a[n_] := Module[{r = 1}, Do[If[PowerMod[m, 10, n] == 1, r = m; Break[]], {m, 2, n-1}]; r]; Array[a, 100] (* Jean-François Alcover, Nov 10 2015 *)
PROG
(PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^10) == 1, return (m)); ); return (1); } \\ Michel Marcus, Jun 29 2014
CROSSREFS
Cf. A070667.
Sequence in context: A319704 A331304 A343721 * A096894 A097751 A070667
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 08 2002
STATUS
approved