cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A177865 Polya-Vinogradov numbers: a(n) is the maximum over all k > 0 of |#(quadratic residues modulo p up to k) - #(quadratic nonresidues modulo p up to k)| where p is the n-th prime and n > 1.

Original entry on oeis.org

1, 1, 2, 3, 2, 2, 3, 5, 3, 6, 4, 4, 5, 8, 5, 9, 4, 6, 10, 5, 10, 9, 6, 6, 7, 10, 9, 6, 6, 10, 15, 7, 9, 7, 14, 8, 9, 18, 9, 15, 7, 19, 8, 11, 18, 12, 15, 15, 9, 10, 22, 8, 21, 10, 21, 11, 22, 14, 10, 13, 11, 14, 25, 11, 13, 14, 12, 17, 12, 12, 27, 19, 16, 15, 27, 12, 12, 12, 12, 27, 11, 30
Offset: 2

Views

Author

Jonathan Sondow, May 17 2010

Keywords

Comments

In 1918 Polya and Vinogradov (independently) proved an upper bound for a(n) and Schur proved a lower bound:
sqrt(p)/2*pi < a(n) < sqrt(p)*log(p), where p is the n-th prime.
Named after the Hungarian mathematician George Pólya (1887-1985) and the Soviet mathematician Ivan Matveevich Vinogradov (1891-1983). - Amiram Eldar, Jun 22 2021

Examples

			The initial term is a(2) = 1 because the 2nd prime is 3 and L(1/3) = 1 and L(2/3) = -1, so |Sum_{i=1..k} L(i/3)| = 1 and 0 for k = 1 and 2, resp., and so max = 1.
		

References

  • I. M. Vinogradov, Über eine asymptotische Formel aus der Theorie der binaeren quadratischen Formen, J. Soc. Phys. Math. Univ. Permi, Vol. 1 (1918), pp. 18-28.
  • I. M. Vinogradov, Elements of Number Theory, 5th revised ed., Dover, 1954, p. 200.

Crossrefs

Cf. A055088 (Triangle of generalized Legendre symbols L(a/b), with 1's for quadratic residues and 0's for quadratic non-residues [replace the 0's with -1's]).

Programs

  • Mathematica
    Table[Max[ Table[Abs[Sum[JacobiSymbol[i, Prime[n]], {i, 1, k}]], {k, 1, Prime[n] - 1}]], {n, 2, 100}]
  • PARI
    a(n) = my(p=prime(n)); vecmax(vector(p-1, k, vecsum(vector(k, i, issquare(Mod(i, p)))) - vecsum(vector(k, i, !issquare(Mod(i, p)))))); \\ Michel Marcus, Mar 03 2023

Formula

a(n) = max_{01, and L(i/p) is the Legendre symbol.

A207291 Polya-Vinogradov numbers A177865 for primes p == 1 (mod 4).

Original entry on oeis.org

1, 2, 2, 3, 4, 4, 5, 4, 5, 6, 6, 7, 6, 6, 7, 7, 8, 9, 7, 8, 11, 9, 10, 8, 10, 11, 14, 10, 11, 11, 13, 12, 12, 12, 16, 12, 12, 12, 12, 11, 14, 13, 12, 15, 15, 16, 14, 19, 16, 16, 16, 14, 20, 16, 15, 21, 16, 16, 19, 17, 15, 18, 22, 20, 17, 17, 18, 16, 17, 17
Offset: 1

Views

Author

Jonathan Sondow, Feb 16 2012

Keywords

Comments

Polya-Vinogradov numbers for all odd primes is A177865, and for primes p == 3 (mod 4) is A207292.

Examples

			The 3rd prime == 1 (mod 4) is 17 = prime(7), and A177865(7) = 2 (not 3, because the offset of A177865 is 2, not 1), so a(3) = 2.
		

Crossrefs

Programs

  • Mathematica
    T = Table[Max[Table[Abs[Sum[JacobiSymbol[i, Prime[n]], {i, 1, k}]], {k, 1, Prime[n] - 1}]], {n, 2, 200}]; P = Table[Mod[Prime[n], 4], {n, 2, 200}]; Pick[T, P, 1]

Formula

a(n) = max_{0
Showing 1-2 of 2 results.