A note on Linnik’s theorem on quadratic non-residues

Abstract

We present a short and purely combinatorial proof of Linnik’s theorem: for any ε> 0 there exists a constant C ε such that for any N, there are at most C ε primes p≤ N such that the least positive quadratic non-residue modulo p exceeds N ε .

Publication Title

Archiv der Mathematik

Share

COinS