Related papers: Improving riemann prime counting
The Riemann hypothesis, stating that the real part of all non-trivial zero points fo the zeta function must be $\frac{1}{2}$, is one of the most important unproven hypothesises in number theory. In this paper we will proof the Riemann…
Prime numbers, whose properties are important subjects in mathematics, are also fundamental in computer science notably in IT security, Cryptocurrencies as Bitcoin and Blockchain, cryptography, Code theory notably Error detection codes,…
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…
We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.
In recent work by Botkin, Dawsey, Hemmer, Just and the present author, a deterministic model of prime number distribution is developed based on properties of integer partitions that gives almost exact estimates for $\pi(n)$, the number of…
For $i\in \{1,2,3\}$, let $E_i(x)$ denote the error term in each of the three theorems of Mertens on the asymptotic distribution of prime numbers. We show that for $i\in \{1,2\}$ the Riemann hypothesis is equivalent to the condition…
Numerical data suggest that the zeros $\rho$ of the auxiliary Riemann function in the upper half-plane satisfy $\mathop{\mathrm{Re}}(\rho)<1$. We show that this is true for those zeros with $\mathop{\mathrm{Im}}(\rho)> 3.9211\dots10^{65}$.…
Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…
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…
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…
The Riemann Hypothesis is not proved yet and this article gives a possible proof for the hypothesis which confirms that the only possible nontrivial zeros of the Riemann zeta-function has its real value equal to 1/2. From the result, the…
Finding hidden order within disorder is a common interest in material science, wave physics, and mathematics. The Riemann hypothesis, stating the locations of nontrivial zeros of the Riemann zeta function, tentatively characterizes…
The Riemann hypothesis, conjectured by Bernhard Riemann in 1859, claims that the non-trivial zeros of $\zeta(s)$ lie on the line $\Re(s) =1/2$. The density hypothesis is a conjectured estimate $N(\lambda, T) =O\bigl(T\sp{2(1-\lambda)…
Let $f(z)=\sum_{n=1}^\infty a(n)q^n\in S^{\text{new}}_ k (\Gamma_0(N))$ be a newform with squarefree level $N$ that does not have complex multiplication. For a prime $p$, define $\theta_p\in[0,\pi]$ to be the angle for which $a(p)=2p^{( k…
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 give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…
Let $F$ be a function in the Selberg class ${\mathcal S}$ and $a$ be a real number not equal to 1/2. Consider the sum $$\lambda_{F}(n,a)=\sum_{\rho}\left[1-\left(\frac{\rho-a}{\rho+a-1}\right)^{n}\right],$$ where $\rho$ runs over the…
In this article, we show that $$ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right| \le 0.1038 \log T + 0.2573 \log\log T + 9.3675 $$ where $N(T)$ denotes the number of non-trivial zeros $\rho$, with $0<\Im(\rho)…
We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.