login
Smallest m in range 1..phi(n) such that 11^m == 1 mod n, or 0 if no such number exists.
9

%I #12 Oct 22 2024 08:01:43

%S 0,1,2,2,1,2,3,2,6,1,0,2,12,3,2,4,16,6,3,2,6,0,22,2,5,12,18,6,28,2,30,

%T 8,0,16,3,6,6,3,12,2,40,6,7,0,6,22,46,4,21,5,16,12,26,18,0,6,6,28,58,

%U 2,4,30,6,16,12,0,66,16,22,3,70,6,72,6,10,6,0,12,39,4

%N Smallest m in range 1..phi(n) such that 11^m == 1 mod n, or 0 if no such number exists.

%t Table[SelectFirst[Range[EulerPhi[n]],PowerMod[11,#,n]==1&,0],{n,80}] (* _Paul F. Marrero Romero_, Oct 21 2024 *)

%o (Magma) [0] cat [Modorder(11, n): n in [2..100]]; // _Vincenzo Librandi_, Apr 01 2014

%Y Cf. A070667-A070675, A002326, A070676, A053447, A070677, A070681, A070678, A053451, A070679, A070682, A070683.

%K nonn

%O 1,3

%A _N. J. A. Sloane_ and _Amarnath Murthy_, May 08 2002