Department of

February 2018March 2018April 2018 Su Mo Tu We Th Fr Sa Su Mo TuWeTh Fr Sa Su Mo Tu We Th Fr Sa 1 2 3 1 2 3 1 2 3 4 5 6 7 4 5 6 7 8 9 10 4 5 6 7 8 9 10 8 9 10 11 12 13 14 11 12 13 14 15 16 17 11 12 13 14 15 16 17 15 16 17 18 19 20 21 18 19 20 21 22 23 24 18 19 202122 23 24 22 23 24 25 26 27 28 25 26 27 28 25 26 27 28 29 30 31 29 30

Thursday, March 8, 2018

**Abstract:** Chebyshev observed that there seems to be more primes congruent to 3 mod 4 than those congruent to 1 mod 4, which is known as Chebyshev’s bias. In this talk, we introduce two generalizations of this phenomenon. 1) Greg Martin conjectured that the difference of the summatory function of the number of prime factors over integers less than x from different arithmetic progressions will attain a constant sign for sufficiently large x. Under some reasonable conjectures, we give strong evidence to support this conjecture. 2) We introduce the function field version of Chebyshev’s bias. We consider the distribution of products of irreducible polynomials over finite fields. When we compare the number of such polynomials among different arithmetic progressions, new phenomenon will appear due to the existence of real zeros for some associated L-functions.