|
%I #14 Aug 07 2023 17:12:00
%S 11,81,1331,81,161051,531441,19487171,6561,2357947691,3486784401,
%T 285311670611,531441,34522712143931,22876792454961,4177248169415651,
%U 43046721,505447028499293771,150094635296999121,61159090448414546291,3486784401,7400249944258160101211,984770902183611232881,895430243255237372246531
%N Smallest n-th power k^n == 1 (mod 10), where k>1.
%F For n==0 (mod 4), a(n) = 3^n; for n==1,3 (mod 4), a(n) = 11^n; for n==2 (mod 4), a(n)=9^n. - _Max Alekseyev_, Dec 06 2013
%t snp[n_]:=Module[{k=2},While[PowerMod[k,n,10]!=1,k++];k^n]; Array[snp,30] (* _Harvey P. Dale_, Aug 07 2023 *)
%o (PARI) a(n) = [3,11,9,11][n%4+1]^n
%K nonn,easy
%O 1,1
%A _Amarnath Murthy_, Jul 07 2003
%E Description corrected by _Ray Chandler_, Jul 08 2003
%E More terms from _Ray Chandler_, Jul 11 2003
|
