Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
117 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Euler's Function on Products of Primes in Progressions (1810.11524v1)

Published 26 Oct 2018 in math.NT

Abstract: We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12, 14$, the generalized Riemann Hypothesis for the Dedekind zeta function of the cyclotomic field $\mathbb{Q}(e{2\pi i/q})$ is true if and only if for all integers $k\geq 1$ we have [\frac{\bar{N}k}{\varphi(\bar{N}_k)(\log(\varphi(q)\log{\bar{N}_k})){\frac{1}{\varphi(q)}}} > \frac{1}{C(q,1)}.] Here $\bar{N}_k$ is the product of the first $k$ primes in the arithmetic progression $p\equiv 1~({\rm mod}~{q})$ and $C(q, 1)$ is the constant appearing in the asymptotic formula [\prod{\substack{p \leq x \ p \equiv 1~({\rm mod}~{q})}} \left(1 - \frac{1}{p}\right) \sim \frac{C(q, 1)}{(\log{x})\frac{1}{\varphi(q)}},] as $x\rightarrow\infty$. We also prove that, for $q\leq 400,000$ and integers $a$ coprime to $q$, the analogous inequality [\frac{\bar{N}_k}{\varphi(\bar{N}_k)(\log(\varphi(q)\log{\bar{N}_k})){\frac{1}{\varphi(q)}}} > \frac{1}{C(q,a)}] holds for infinitely many values of $k$. If in addition $a$ is a not a square modulo $q$, then there are infinitely many $k$ for which this inequality holds and also infinitely many $k$ for which this inequality fails.

Summary

We haven't generated a summary for this paper yet.