cp's OEIS Frontend

A070670 Smallest m in range 2..n-1 such that m^5 == 1 mod n, or 1 if no such number exists.

%I A070670 #12 Jul 20 2015 07:29:34
%S A070670 1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,1,1,3,1,1,6,1,1,1,1,1,2,1,4,1,
%T A070670 1,1,1,1,1,1,10,1,1,5,1,1,1,1,1,11,1,1,1,1,16,1,1,1,1,1,9,33,1,1,1,25,
%U A070670 1,1,1,1,5,1,1,1,16,1,15,1,1,1,1,37,1,1,1,1,1,9,1,1
%N A070670 Smallest m in range 2..n-1 such that m^5 == 1 mod n, or 1 if no such number exists.
%H A070670 Alois P. Heinz, <a href="/A070670/b070670.txt">Table of n, a(n) for n = 1..10000</a>
%p A070670 a:= proc(n) local m;
%p A070670       for m from 2 to n-1 do
%p A070670         if m &^ 5 mod n = 1 then return m fi
%p A070670       od; 1
%p A070670     end:
%p A070670 seq(a(n), n=1..100);  # _Alois P. Heinz_, Jun 29 2014
%t A070670 a[n_] := (For[m = 2, m <= n - 1, m++, If[PowerMod[m, 5, n] == 1, Return[m]]]; 1); Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Jul 20 2015 *)
%o A070670 (PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^5) == 1, return (m));); return (1);} \\ _Michel Marcus_, Jun 29 2014
%Y A070670 Cf. A070667.
%K A070670 nonn
%O A070670 1,11
%A A070670 _N. J. A. Sloane_, May 08 2002