Let $\{a\_n\}\_{n\in\mathbb{N}}$ be defined as $a\_n = a + bn$ for some $a, b >0,(a, b) = 1$. Are there good bounds on the minimal $k$ s.t. $a\_k$ is prime. It is well known that there are infinitely many primes in this series, 



Smallest prime in an arithmetic progression
This is Linnik's theorem, and the best known bound is $O(b^5)$ due to Xylouris. (This is in the Wikipedia page, and as I admitted in this year's JMM I added it to the Wikipedia page. It's in his thesis but otherwise unpublished as far as I know.)


