相关论文: Towards an Elementary Formulation of the Riemann H…

Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…

The Landau function $g(n)$ is the maximal order of an element of the symmetric group of degree $n$; it is also the largest product of powers of primes whose sum is $\le n$. The main result of this article is that the property " For all $n >…

For n>1, let G(n)=\sigma(n)/(n log log n), where \sigma(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime…

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 give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log…

We combine our version of the resonance method with certain convolution formulas for $\zeta(s)$ and $\log\, \zeta(s)$. This leads to a new $\Omega$ result for $|\zeta(1/2+it)|$: The maximum of $|\zeta(1/2+it)|$ on the interval $1 \le t \le…

This analysis which uses new mathematical methods aims at proving the Riemann hypothesis and figuring out an approximate base for imaginary non-trivial zeros of zeta function at very large numbers, in order to determine the path that those…

Under the Riemann Hypothesis, we prove for any natural number $r$ there exist infinitely many large natural numbers $n$ such that $(\gamma_{n+r}-\gamma_n)/(2\pi /\log \gamma_n) > r + \Theta\sqrt{r}$ and $(\gamma_{n+r}-\gamma_n)/(2\pi /\log…

A work by Nicolas has shown that if it can be proven that a certain inequality holds for all $n$, the Riemann hypothesis is true. This inequality is associated with the Mertens theorem, and hence the Euler totient at $\prod_{k=1}^n p_k$,…

Let $\mathcal{P}$ be the set of all primes and $\psi(n)=n\prod_{n\in \mathcal{P},p|n}(1+1/p)$ be the Dedekind psi function. We show that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n <0$ for all…

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…

Robin's Inequality posits $G(n)<e^{\gamma}$ for $n>5040$. Robin also showed that if the Riemann Hypothesis (RH) is false, then $G(n)>e^{\gamma}\left(1+\displaystyle\frac{c}{(\log n)^{b}}\right)$ for infinitely many values of $n$. By…

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…

A proof of the Riemann hypothesis is proposed by relying on the properties of the Mellin transform. The function $\mathfrak{G}_{\eta}\left(t\right)$ is defined on the set $\bar{\mathbb{R}}_+$ of the non-negative real numbers, in term of a…

Inspired by Cohen and te Riele~\cite{Cohen1996}, who computationally verified that for every $n \leq 400$ there exists $k$ such that $\sigma^k(n) \equiv 0 \pmod{n}$ (where $\sigma^k$ denotes the $k$-fold iteration of the sum-of-divisors…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

This paper shows the equivalence of the Riemann hypothesis to an sequence of elementary inequalities involving the harmonic numbers H_n, the sum of the reciprocals of the integers from 1 to n. It is a modification of a criterion due to Guy…

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 classical theorem of Schnirelmann states that the primes are an additive basis for the integers. In this paper we consider the analogous multiplicative setting of the cyclic group $\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$, and…