Related papers: The Analytic Expression for Riemann's Prime Counti…
We prove several results regarding the distribution of numbers that are the product of a prime and a $k$-th power. First, we prove an asymptotic formula for the counting function of such numbers; this generalises a result of E. Cohen. We…
We give a generalized and effective version of Bekehermes' improvement of Newman's Tauberian theorem. To do so we prove an effective version of the Riemann-Lebesgue Lemma for functions of bounded $p$-variation. We apply our Tauberian…
We present an explicit formula for a weighted sum over the zeros of the Riemann zeta function. This weighted sum is evaluated in terms of a sum over the prime numbers, weighted with help of the Hermite polynomials. From the explicit formula…
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…
$\Theta$ function is defined based upon Kronecher symbol. In light of the principle of inclusion-exclusion, $\Theta$ function of sine function is used to denote the distribution of composites and primes. The structure of Goldbach Conjecture…
Let $1/2\leq\beta<1$, $p$ be a generic prime number and $f_\beta$ be a random multiplicative function supported on the squarefree integers such that $(f_\beta(p))_{p}$ is an i.i.d. sequence of random variables with distribution…
We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.
We prove the Riemann Hypothesis via an analytically regulated surface integral over the critical strip of the Riemann zeta function. The key idea is that the convergence of this normalized integral is equivalent to the condition that all…
Finite element exterior calculus (FEEC) has been developed over the past decade as a framework for constructing and analyzing stable and accurate numerical methods for partial differential equations by employing differential complexes. The…
When it comes to partial numerical verification of the Riemann Hypothesis, one crucial part is to verify the completeness of a list of pre-computed zeros. Turing developed such a method, based on an explicit version of a theorem of…
Assume the Riemann hypothesis throughout. We obtain some new estimates for the size of the set of large values of the error term in the prime number theorem. Our argument is based on an analysis of the behavior of zeros of the Riemann zeta…
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…
On the one hand the Fermi-Dirac and Bose-Einstein functions have been extended in such a way that they are closely related to the Riemann and other zeta functions. On the other hand the Fourier transform representation of the gamma and…
Reverse Mathematics is a program in the foundations of mathematics which provides an elegant classification of theorems of ordinary mathematics based on computability. Our aim is to provide an alternative classification of theorems based on…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
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…
The introduction of strings into the study of the Riemann Hypothesis provides a visualization of the genesis of zeros for the Zeta function. The method is heuristic and when originally introduced suggested strong visual evidence for the…
This is a new proof of the tauberian theorem of complex Laplace transformation for getting a simple proof of the prime numbers theorem $\pi(x) \sim \frac{x}{\log(x)}$ for a largest real $x$.
In this paper, we establish new bounds for classical prime-counting functions. All of our bounds are explicit and assume the Riemann Hypothesis. First, we prove that $|\psi(x) - x|$ and $|\vartheta(x) - x|$ are bounded from above by…
Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}\pi(x)=\Theta(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber…