A (not so) mean feat of Erdos

Paul Pollack

A notorious problem in analytic number theory is to understand the distribution of squares modulo primes p. For example, if n2(p) denotes the least positive quadratic nonresidue modulo p, then Vinogradov conjectured that n2(p) is eventually smaller than pϵ, for any fixed ϵ > 0. We are far from proving this; the state-of-the art in this direction is a result of Burgess, now fifty years old, that any ϵ > (4√ -
  e)-1 is permissible.

Instead of looking at the maximal order of n2(p), one might consider the average size of n2(p). This was determined by Erd˝o  s in 1961: The mean value of n2(p) is the finite constant k=1pk2k 3.675, where pk denotes the kth prime in increasing order. In this talk, we discuss some recently obtained extensions and generalizations of Erdos’s result. In particular, we sketch a determination of the size of the the average least non-split prime in a cubic number field. Some of these results represent joint work with Greg Martin.