On consecutive quadratic non-residues: a conjecture of Issai Schur
Patrick Hummel
Abstract
Issai Schur once asked if it was possible to determine a bound, preferably using elementary methods, such that for all prime numbers p greater than the bound, the greatest number of consecutive quadratic non-residues modulo p is always less than the square root of p. This paper uses elementary methods to prove that 13 is the only prime number for which the greatest number of consecutive quadratic non-residues modulo p exceeds the square root of p.
Create a lesson
Related papers
The existence of small defining polynomials for number fields
Manjul Bhargava, Sameera Vemulapalli
Arithmetic Siegel--Weil formula on the product of modular curves
Ryan C. Chen, Baiqing Zhu
The large sieve inequality and additive decompositions of sums of squares
Christian Elsholtz, Julia Stadlmann
Universal norms of partially de Rham B-pairs and perfectness in Lubin--Tate Iwasawa theory
Marvin Schneider, Rustam Steingart
GCD and ABC inequalities for abelian varieties over function fields
Guoquan Gao
S-squareful values of binary quadratic forms
Sarah Sophie Pohl