|
%I #9 Sep 08 2012 05:15:57
%S 2,5,7,11,23,29,31,37,47,59,67,71,73,89,101,109,127,139,157,163,211,
%T 227,229,233,239,277,283,293,307,313,331,347,373,383,409,439,443,467,
%U 479,487,491,509,521,523,557,563
%N Primes p such that 71 is a square mod p.
%C Also, only entries p=1 (mod 4) of the sequence are squares mod 71 (from the quadratic reciprocity law). - _Lekraj Beedassy_, Jul 21 2004
%H Vincenzo Librandi, <a href="/A038955/b038955.txt">Table of n, a(n) for n = 1..1000</a>
%t Select[Prime[Range[110]], ! JacobiSymbol[71, #] == -1 &] (* _Vincenzo Librandi_, Sep 08 2012 *)
%K nonn
%O 1,1
%A _N. J. A. Sloane_.
|
