|
%I #22 Jan 28 2018 02:33:02
%S 0,1,3,4,5,9,12,13,14,15,16,19,20,22,25,27,34,36,39,41,42,45,46,47,48,
%T 49,52,56,57,58,60
%N Squares mod 61.
%C That is, numbers 0 <= n < 61 such that n is a square modulo 61.
%t Union[Mod[Range[0, 60]^2, 61]] (* _T. D. Noe_, Apr 21 2011 *)
%t Union[PowerMod[Range[0,600],2,61]] (* _Harvey P. Dale_, May 22 2014 *)
%o (Sage) [quadratic_residues(61)] # _Zerinvary Lajos_, May 24 2009
%o (PARI) for(n=0,60,if(issquare(Mod(n,61)),print1(n", "))) \\ _Franklin T. Adams-Watters_, Apr 21 2011
%K nonn,fini,full
%O 1,3
%A _N. J. A. Sloane_
|
