Related papers: Small values of the Euler function and the Riemann…

In this article, with a new approach, which is not discussed in the literature yet, the limit of the Riemann zeta function or Euler-Riemann zeta function is approximately explored by applying Dirichlet's rearrangement theorem for absolutely…

In these lectures we first review the important properties of the Riemann $\zeta$-function that are necessary to understand the nature and importance of the Riemann hypothesis (RH). In particular this first part describes the analytic…

This paper has two parts. The first part surveys Euler's work on the constant gamma=0.57721... bearing his name, together with some of his related work on the gamma function, values of the zeta function and divergent series. The second part…

Building on work in \cite{AB24} on the Riemann zeta function at height $T$ off the critical line, we prove an unconditional lower bound on the critical line for real large deviations of the order $V\sim\alpha\log\log T$ for any $\alpha>0.$…

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

We study a class of approximations to the Riemann zeta function introduced earlier by the second author on the basis of Euler product. This allows us to justify Euler Product Sieve for generation of prime numbers. Also we show that Bounded…

The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…

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…

Let $t$ be random and uniformly distributed in the interval $[T,2T]$, and consider the quantity $N(t+1/\log T) - N(t)$, a count of zeros of the Riemann zeta function in a box of height $1/\log T$. Conditioned on the Riemann hypothesis, we…

In this paper, we prove that the Fourier entropy of an $n$-dimensional boolean function $f$ can be upper-bounded by $O(I(f)+ \sum\limits_{k\in[n]}I_k(f)\log \frac{1}{I_k(f)})$, where $I(f)$ is its total influence and $I_k(f)$ is the…

We show that if the Riemann Hypothesis is true, then in a region containing most of the right-half of the critical strip, the Riemann zeta-function is well approximated by short truncations of its Euler product. Conversely, if the…

In this article, we derive a Euler prime product formula for the magnitude of the Riemann zeta function $\zeta(s)$ valid for $\Re(s)>1$, as well as similar formulas for $\zeta(s)$ valid for an even and odd $k$th positive integer argument.…

Assuming the Generalized Riemann Hypothesis, we provide uniform upper bounds with explicit main terms for moduli of $\left(\cL'/\cL\right)(s)$ and $\log{\cL(s)}$ for $1/2+\delta\leq\sigma<1$, fixed $\delta\in(0,1/2)$ and for functions in…

Assuming the Riemann hypothesis, we prove that $$ N_k(T) = \frac{T}{2\pi}\log \frac{T}{4\pi e} + O_k\left(\frac{\log{T}}{\log\log{T}}\right), $$ where $N_k(T)$ is the number of zeros of $\zeta^{(k)}(s)$ in the region $0<\Im s\le T$. We…

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…

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,…

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…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

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…