Primeshard
0:00.0
The Linnik theorem states: for gcd(a,d)=1, the smallest prime p≡a(mod d) satisfies:
The Linnik theorem states: for gcd(a,d)=1, the smallest prime p≡a(mod d) satisfies:
The Linnik theorem states: for gcd(a,d)=1, the smallest prime p≡a(mod d) satisfies: