Related papers: An Equivalent Statement to Nicolas' Criterion

In this paper, we make use of Robin and Lagarias' criteria to prove Riemann hypothesis. The goal is, using Lagarias criterion for $n\geq 1$ since Lagarias criterion states that Riemann hypothesis holds if and only if the inequality…

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

An equivalent, but variant form of the Riemann functional equation is explored, and several discoveries are made. Properties of the Riemann zeta function $\zeta(s)$ from which a necessary and sufficient condition for the existence of zeros…

Assuming the validity of Riemann Hypothesis (RH), we derive the explicit bilateral estimates ("narrow passage") of the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals. These results are reversable,…

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…

The Robin criterion states that the Riemann hypothesis is equivalent to the inequality $\sigma(n) < e^\gamma n \log \log n$ for all $n>5040$, where $\sigma(n)$ is the sum of divisors of $n$, and $\gamma$ is the Euler--Mascheroni constant.…

The Riesz-Sobolev inequality provides a sharp upper bound for a trilinear expression involving convolution of indicator functions of sets. Equality is known to hold only for indicator functions of appropriately situated intervals. We…

We upgrade Howard's divisibility toward Perrin-Riou's Heegner point Main Conjecture to an equality under some mild conditions. We do this by exploiting Wei Zhang's proof of the Kolyvagin conjecture. The main ingredient is an improvement of…

The paper provides the proof of the Rimann's conjecture. The results of the works of A. M. Odlyzko and H. te Riile "Disproof of the Conjecture", which gives a disproof of the Mertens hypothesis, using to prove the Riemann's hypothesis. This…

In 1916, Riesz gave an equivalent criterion for the Riemann hypothesis (RH). Inspired from Riesz's criterion, Hardy and Littlewood showed that RH is equivalent to the following bound: \begin{align*} P_1(x):= \sum_{n=1}^\infty…

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

The Riemann Hypothesis states that within the strip region of the complex plane $0 < {\rm Re}(s) < 1$, the Riemann $\xi(s)$ function has zeros only on the critical line ${\rm Re}(s) = \frac{1}{2}$ and none elsewhere. To prove the Riemann…

Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…

In [2] we introduced a new notion of Wilf equivalence of integer partitions and proved that rook equivalence implies Wilf equivalence. In the present paper we prove the converse and thereby establish a new criterion for rook equivalence. We…

Four propositions are considered concerning the relationship between the zeros of two combinations of the Riemann zeta function and the function itself. The first is the Riemann hypothesis, while the second relates to the zeros of a…

We investigate the relation between the Riesz and the Baez-Duarte criterion for the Riemann Hypothesis. In particular we present the relation between the function $R(x)$ appearing in the Riesz criterion and the sequence $c_k$ appearing in…

Let $\rho(x)=x-[x]$, $\chi=\chi_{(0,1)}$. In $L_2(0,\infty)$ consider the subspace $\B$ generated by $\{\rho_a | a \geq 1\}$ where $\rho_a(x):=\rho(\frac{1}{ax})$. By the Nyman-Beurling criterion the Riemann hypothesis is equivalent to the…

We introduce a new set of prime numbers functions including an exact Generating Function and a Discriminating Function of Prime Numbers neither based on prime number tables nor on algorithms. Instead these functions are defined in terms of…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient…