|
%I #13 Nov 10 2015 03:24:00
%S 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,
%T 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,
%U 13,20,57,58,11,3,15,8,31,14,5,66,33,22,29,5,17,72,73
%N Smallest m in range 2..n-1 such that m^10 == 1 mod n, or 1 if no such number exists.
%H Alois P. Heinz, <a href="/A070675/b070675.txt">Table of n, a(n) for n = 1..10000</a>
%p a:= proc(n) local m;
%p for m from 2 to n-1 do
%p if m &^ 10 mod n = 1 then return m fi
%p od; 1
%p end:
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jun 29 2014
%t 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 *)
%o (PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^10) == 1, return (m));); return (1);} \\ _Michel Marcus_, Jun 29 2014
%Y Cf. A070667.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, May 08 2002
|
