On consecutive quadratic non-residues: a conjecture of Issai Schur

Simple item page
dc.creatorHummel, Patrick
dc.date2003-05-21
dc.date.accessioned2026-07-07T04:58:10Z
dc.date.available2026-07-07T04:58:10Z
dc.descriptionIssai 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.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0305298
dc.identifierhttp://arxiv.org/abs/math/0305298
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67525
dc.subjectNumber Theory
dc.subject11A15
dc.titleOn consecutive quadratic non-residues: a conjecture of Issai Schur
dc.typetext

Files

Collections

arXiv