|
%I #20 Jul 04 2023 09:44:42
%S 5,7,11,19,37,43,53,79,83,89,97,107,113,127,131,137,139,151,157,167,
%T 181,211,227,229,239,257,263,269,271,283,307,313,317,347,353,359,389,
%U 397,401,421,431,433,439,449,479,491,503,509,521,523,547,563,571,577
%N Odd primes p such that 11 is a square mod p.
%C Also, only entries p=1 (mod 4) of the sequence are squares mod 11 (from the quadratic reciprocity law). - _Lekraj Beedassy_, Jul 21 2004
%H Zak Seidov, <a href="/A038881/b038881.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[Prime[Range[120]],! JacobiSymbol[11, #]== -1 &] (* _Vincenzo Librandi_, Sep 10 2012 *)
%o (PARI) forprime(p=2,1000,if(kronecker(11,p)==+1,print1(p,", "))) /* _Joerg Arndt_, Apr 24 2011 */
%o (Magma) [p: p in PrimesInInterval(3,577) | not JacobiSymbol(11,p) eq -1]; // _Bruno Berselli_, Sep 10 2012
%Y Cf. A038882.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_.
%E Added "odd" to definition (otherwise 2 would be a term). - _N. J. A. Sloane_, Jul 04 2023
|
