A note on Linnik’s theorem on quadratic non-residues
- 15 Downloads
We present a short and purely combinatorial proof of Linnik’s theorem: for any \(\varepsilon >0\) there exists a constant \(C_\varepsilon \) such that for any N, there are at most \(C_\varepsilon \) primes \(p\le N\) such that the least positive quadratic non-residue modulo p exceeds \(N^\varepsilon \).
KeywordsCombinatorial number theory Quadratic non-residues Combinatorial sieve
Mathematics Subject Classification11A15 11A41 11N35 11B75
Unable to display preview. Download preview PDF.
The work of the first two authors was partially supported by NSF Grant DMS 1600742, and work of the second author was also partially supported by MULTIPLEX Grant 317532. The work of the fourth author was partially supported by CNPq (Proc. 303275/2013-8) and FAPERJ (Proc. 201.598/2014). The research in this paper was carried out while the third, fourth and fifth authors were visiting the University of Memphis.
- 1.Balister, P., Bollobás, B., Lee, J.D., Morris, R., Riordan, O.: A note on Linnik’s theorem on quadratic non-residues, arXiv:1712.07179
- 3.Cojocaru, A.C., Murty, M.R.: An Introduction to Sieve Methods and Their Applications, London Mathematical Society Student Texts, vol. 66. Cambridge University Press, Cambridge (2006)Google Scholar