English
Related papers

Related papers: Extreme values of the Dedekind $\Psi$ function

200 papers

Robin's criterion states that the Riemann hypothesis is equivalent to $\sigma(n) < e^\gamma n \log\log n$ for all integers $n \geq 5041$, where $\sigma(n)$ is the sum of divisors of $n$ and $\gamma$ is the Euler-Mascheroni constant. We…

Number Theory · Mathematics 2020-08-12 Lawrence C. Washington , Ambrose Yang

Let $\psi_\K$ be the Chebyshev function of a number field $\K$. Under GRH we prove an explicit upper bound for $|\psi_\K(x)-x|$ in terms of the degree and the discriminant of $\K$. The new bound improves significantly on previous known…

Number Theory · Mathematics 2019-05-28 Loïc Grenié , Giuseppe Molteni

Let $S(\sigma,t)=\frac{1}{\pi}\arg\zeta(\sigma+it)$ be the argument of the Riemann zeta-function at the point $\sigma+it$ in the critical strip. For $n\geq 1$ and $t>0$, we define \begin{equation*} S_{n}(\sigma,t) = \int_0^t…

Number Theory · Mathematics 2021-03-18 Andrés Chirre , Kamalakshya Mahatab

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Number Theory · Mathematics 2012-09-20 Zhi-Wei Sun

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Number Theory · Mathematics 2008-10-06 Joseph B. Keller

A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…

Number Theory · Mathematics 2007-10-10 Jonathan Sondow

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

Number Theory · Mathematics 2023-02-09 Ze-Yong Kong , Lee-Peng Teo

The conjectured Robin inequality for an integer $n>7!$ is $\sigma(n)<e^\gamma n \log \log n,$ where $\gamma$ denotes Euler constant, and $\sigma(n)=\sum_{d | n} d $. Robin proved that this conjecture is equivalent to Riemann hypothesis…

Number Theory · Mathematics 2016-02-11 Patrick Solé , Yuyang Zhu

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

General Mathematics · Mathematics 2021-04-12 N. A. Carella

We show for even positive integers $n$ that the quotient of the Riemann zeta values $\zeta(n+1)$ and $\zeta(n)$ satisfies the equation $$\frac{\zeta(n+1)}{\zeta(n)} = (1-\frac{1}{n}) (1-\frac{1}{2^{n+1}-1})…

Number Theory · Mathematics 2014-10-30 Bernd C. Kellner

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

Number Theory · Mathematics 2014-03-25 Juan Arias de Reyna , Toulisse Jeremy

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…

Number Theory · Mathematics 2022-05-26 Jan Büthe

Erd\"os and Zaremba showed that $ \limsup_{n\to \infty} \frac{\Phi(n)}{(\log\log n)^2}=e^\g$, $\g$ being Euler's constant, where $\Phi(n)=\sum_{d|n} \frac{\log d}{d}$. We extend this result to the function $\Psi(n)= \sum_{d|n} \frac{(\log d…

Number Theory · Mathematics 2020-12-29 Michel Jean Georges Weber

Suppose that the Riemann hypothesis is false and $\rho_{*} = 1/2 + \eta_{*} + i \gamma_{*}$, $\eta_{*} > 0$, is a nontrivial zero of the Riemann $\zeta$-function off the critical line. Under the negation of the Riemann hypothesis for the…

General Mathematics · Mathematics 2026-03-10 Hisanobu Shinya

As essential condition for the validy of Robin's Theorem as a precondition for the proof of the Riemann hypothesis, we show that the minimum of the function $F={\rm e}^{\gamma}\,\ln(\ln\,n)-\sigma(n)/n$ is found to be positive. Therefore,…

Number Theory · Mathematics 2024-03-12 Dmitri Martila , Stefan Groote

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

Number Theory · Mathematics 2022-06-15 Daniel R. Johnston

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

Number Theory · Mathematics 2021-09-22 Tomohiro Yamada

The convex hull of the subgraph of the prime counting function $x\rightarrow \pi(x)$ is a convex set, bounded from above by a graph of some piecewise affine function $x\rightarrow \epsilon(x)$. The vertices of this function form an infinite…

Number Theory · Mathematics 2014-08-18 Edward Tutaj

We investigate the extreme values of the Riemann zeta function $\zeta(s)$. On the 1-line, we obtain a lower bound evaluation $$\max_{t\in[1,T]}|\zeta(1+\i t)|\ge {\rm e}^\gamma(\log_2T+\log_3T+c),$$ with an effective constant $c$ which…

Number Theory · Mathematics 2022-03-15 Zikang Dong , Bin Wei

It is proved that if $T$ is sufficiently large, then uniformly for all positive integers $\ell \leqslant (\log T) / (\log_2 T)$, we have \begin{equation*} \max_{T\leqslant t\leqslant 2T}\left|\zeta^{(\ell)}\Big(1+it\Big)\right| \geqslant…

Number Theory · Mathematics 2021-08-06 Daodao Yang