This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178153 Difference between the numbers of quadratic residues (mod p) less than p/2 and greater than p/2, where p=prime(n). 4

%I

%S 1,0,1,3,0,0,3,3,0,3,0,0,3,5,0,9,0,3,7,0,5,9,0,0,0,5,9,0,0,5,15,0,9,0,

%T 7,0,3,11,0,15,0,13,0,0,9,9,7,15,0,0,15,0,21,0,13,0,11,0,0,9,0,9,19,0,

%U 0,9,0,15,0,0,19,9,0,9,17,0,0,0,0,27,0,21,0,15,15,0,0,0,7,21,25,7,27,9,21,0

%N Difference between the numbers of quadratic residues (mod p) less than p/2 and greater than p/2, where p=prime(n).

%C When prime(n)=1 (mod 4), then a(n)=0. When prime(n)=3 (mod 4), then a(n)>0. When prime(n)=3 (mod 8) and prime(n)>3, then 3 divides a(n). See Borevich and Shafarevich. The nonzero terms of this sequence are closely related to A002143, the class number of primes p=3 (mod 4).

%C Same as difference between the numbers of quadratic residues and nonresidues (mod p) less than p/2, where p=prime(n). - Jonathan Sondow, Oct 30 2011

%D Z. I. Borevich and I. R. Shafarevich, Number Theory, Academic Press, NY, 1966, p. 346.

%D H. Davenport, Multiplicative Number Theory, Graduate Texts in Math. 74, 2nd ed., Springer, 1980, p. 51.

%H R. J. Mathar, <a href="/A178153/b178153.txt">Table of n, a(n) for n = 2..2066</a>

%H MathOverflow, <a href="http://mathoverflow.net/questions/25263">Most squares in the first half-interval</a>

%F a(n) = A178151(n) - A178152(n).

%F a(n) = sum(j=1..(p-1)/2, (j|p)), where p = prime(n) and (j|p) = +/-1 is the Legendre symbol. - _Jonathan Sondow_, Oct 30 2011

%e The quadratic residues of 19, the 8th prime, are 1, 4, 5, 6, 7, 9, 11, 16, 17. Hence a(8)=6-3=3.

%p A178153 := proc(n)

%p local r,a,p;

%p p := ithprime(n) ;

%p a := 0 ;

%p for r from 1 to p/2 do

%p if numtheory[legendre](r,p) =1 then

%p a := a+1 ;

%p end if;

%p end do:

%p for r from ceil(p/2) to p-1 do

%p if numtheory[legendre](r,p) =1 then

%p a := a-1 ;

%p end if;

%p end do:

%p a;

%p end proc: # _R. J. Mathar_, Feb 10 2017

%t Table[p=Prime[n]; Length[Select[Range[(p-1)/2], JacobiSymbol[ #,p]==1&]] - Length[Select[Range[(p+1)/2,p-1], JacobiSymbol[ #,p]==1&]], {n,2,100}]

%t Table[p = Prime[n]; Sum[ JacobiSymbol[a, p], {a, 1, (p-1)/2}], {n, 2, 100}] (* _Jonathan Sondow_, Oct 30 2011 *)

%Y Cf. A178154 (without the zero terms).

%K nonn

%O 2,4

%A _T. D. Noe_, May 21 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 00:55 EDT 2019. Contains 324217 sequences. (Running on oeis4.)