arXiv · 1712.07179
A note on Linnik's Theorem on quadratic non-residues
Abstract
We present a short, self-contained, 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 \leqslant N$ such that the least positive quadratic non-residue modulo $p$ exceeds $N^\varepsilon$.
Explore related subjects
Keep this discovery
Paul Balister, Béla Bollobás, Jonathan D. Lee, Robert Morris, Oliver Riordan. 2017-12-19. A note on Linnik's Theorem on quadratic non-residues. https://arxiv.org/abs/1712.07179
Cite the original work for its findings. Save a collection to share your selection of sources.