On primitive Dirichlet characters and the Riemann hypothesis (Q2268793)

For every positive integer \(n\), let \(\chi_n^{\prime}\) be the set of primitive Dirichlet characters modulo \(n\). For \(k\geq 1\) let \(n_k\) be the product of the first \(k\) primes. The authors prove that if the Riemann hypothesis is true then \[ \forall k\geq 1,\quad |\chi_{2n_k}^{\prime}| \leq C_2 e^{-\gamma} \frac{\varphi (2n_k)} {\log \log (2n_k)}, \] where \(\varphi\) is Euler's function, \(\gamma\) is Euler's constant and \(C_2=\prod_{p>2}\frac{p(p-2)}{(p-1)^2}\) is the twin prime constant. If the Riemann hypothesis is false, then there are infinitely many \(k\) for which the inequality is true and infinitely many \(k\) for which it is false.