Journal title
Archiv der Mathematik
DOI
10.1007/s00013-018-1281-y
Issue
4
Volume
112
Last updated
2024-04-11T22:16:55.55+01:00
Page
371-375
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ε .
Symplectic ID
896004
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
11 Jan 2019