Primeshard
0:00.0

Linnik's Theorem provides a bound on the smallest prime p(a,d)p(a, d) in an arithmetic progression a,a+d,a+2d,a, a+d, a+2d, \dots. It states that p(a,d)<cdLp(a, d) < c \cdot d^L. What is the current best known value for the Linnik constant LL?