Leo Goldmakher, University of Toronto
“Bounds on the least quadratic nonresidue”
Attaining strong bounds on the least quadratic nonresidue (mod p) is a classical problem, with a history stretching back to Gauss. The approach which has led to the best results uses character sums, objects which are ubiquitous in analytic number theory. I will discuss character sums, their connection to the least nonresidue, and some recent work of myself and J. Bober (University of Bristol) on a promising new approach to the problem.
Please note date