Related papers: An Exact Formula for the Prime Counting Function
The partial fraction expansion of coth($\pi$z), due to Euler, is generalized to power series having for coefficients the Riemann zeta function evaluated at certain arithmetic sequences. A further generalization using arbitrary Dirichlet…
We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…
In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $\pi(n)$ which holds infinitely often.
We construct a Beurling generalized number system satisfying the Riemann hypothesis and whose integer counting function displays extremal oscillation in the following sense. The prime counting function of this number system satisfies…
We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) =…
Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…
This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…
We offer some comments on series involving the M$\ddot{o}$bius function which approximate sums over primes. To accomplish this, we utilize the derivative of the Gram series by applying Riemann-Stieltjes integration. We offer a new formula…
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…
We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…
This paper investigates the analytic properties of the Liouville function's Dirichlet series that obtains from the function F(s)= zeta(2s)/zeta(s), where s is a complex variable and zeta(s) is the Riemann zeta function. The paper employs a…
We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
The convex hull of the subgraph of the prime counting function $x\rightarrow \pi(x)$ is a convex set, bounded from above by a graph of some piecewise affine function $x\rightarrow \epsilon(x)$. The vertices of this function form an infinite…
We explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…
The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…
In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…
For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…