login
Primes p for which there is no prime q == 1 (mod 4) that is smaller than p and is a quadratic residue modulo p.
3

%I #13 Nov 21 2013 13:11:56

%S 2,3,5,7,13,37

%N Primes p for which there is no prime q == 1 (mod 4) that is smaller than p and is a quadratic residue modulo p.

%C Gica proved that if p is a prime different from 2, 3, 5, 7, 13, 37, then there exists a prime q < p which is a quadratic residue modulo p and q == 1 (mod 4).

%D A. Gica, Quadratic residues of certain types, Rocky Mt. J. Math. 36 (2006), 1867-1871.

%H A. Gica, <a href="http://atlas-conferences.com/cgi-bin/abstract/cbcw-66">Quadratic residues of certain types</a>, Journées Arithmétiques 2011.

%e p = 7 is a member, because the only prime q < p with q == 1 (mod 4) is q = 5, but 5 is not a quadratic residue modulo 7.

%e 11 is not a member, because 11 > 5 == 1 (mod 4) and 5 == 4^2 (mod 11).

%t maxPrimePi = 100; nextPrime[q_] := If[q1 = NextPrime[q]; Mod[q1, 4] != 1, nextPrime[q1], q1]; foundQ[p_] := (q = 2; found = False; While[q < p, q = nextPrime[q]; If[JacobiSymbol[q, p] == 1, found = True; Break[]]]; found); Select[ Prime[ Range[ maxPrimePi]], Not[foundQ[#]] &] (* _Jean-François Alcover_, Oct 18 2011 *)

%Y Cf. A192579.

%K nonn,fini,full

%O 1,1

%A _Jonathan Sondow_, Jul 04 2011