Speakers

Title: Linnik's problem for Euler's totient function

Abstract: Linnik's famous theorem states that there exists a positive constant C such that for any sufficiently large integer q and any integer a co-prime to q, there exists a prime number p ⩽ q^C such that p ≡ a (mod q). Thanks to works of Jutila, Heath-Brown, Xylouris and others, we now know that one may take C = 5. In this talk I will discuss a variant of Linnik's problem for the Euler's totient function.