Search arXiv⌕ Search

arXiv subjects

C. Wesley Nevans

Publications and source records attributed to C. Wesley Nevans.

4 recordsLinked to original sources
arXiv2008

On primitive Dirichlet characters and the Riemann hypothesis

For any natural number $n$, let $X'_n$ be the set of primitive Dirichlet characters modulo $n$. We show that if the Riemann hypothesis is true, then the inequality $|X'_{2n_k}|\le C_2 e^{-γ} ϕ(2n_k)/\log\log(2n_k)$ holds for all $k\ge 1$, where $n_k$ is the product of the first $k$ primes, $γ$ is the Euler-Mascheroni constant, $C_2$ is the twin prime constant, and $ϕ(n)$ is the Euler function. On the other hand, if the Riemann hypothesis is false, then there are infinitely many $k$ for which the same inequality holds and infinitely many $k$ for which it fails to hold.

math.NT↗
arXiv2008

Sums with multiplicative functions over a Beatty sequence

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence representable as a sum of two squares up to a given magnitude.

math.NT↗
arXiv2007

The Nicolas and Robin inequalities with sums of two squares

In 1984, G. Robin proved that the Riemann hypothesis is true if and only if the Robin inequality $σ(n) 5040$, where $σ(n)$ is the sum of divisors function, and $γ$ is the Euler-Mascheroni constant. We exhibit a broad class of subsets $\cS$ of the natural numbers such that the Robin inequality holds for all but finitely many $n\in\cS$. As a special case, we determine the finitely many numbers of the form $n=a^2+b^2$ that do not satisfy the Robin inequality. In fact, we prove our assertions with the Nicolas inequality $n/ϕ(n) 1$ our results for the Robin inequality follow at once.

math.NT↗