Related papers: On proving an Inequality of Ramanujan using Explic…
This article provides a proof that the Ramanujan's Inequality given by, $$\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$$ holds unconditionally for every $x\geq \exp(43.5102147)$. In case for an alternate proof of the result stated…
In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $\pi(x)$, which improve the current best estimates for large values of $x$. As an…
This article provides a proof of the famous \textit{Prime Number Theorem} by establishing an analogous statement of the same in terms of the second \textit{Chebyshev Function} $\psi(x)$. We shall be extensively using complex analytic…
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)) +…
Ramanujan proved that the inequality $\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$ holds for all sufficiently large values of $x$. Using an explicit estimate for the error in the prime number theorem, we show unconditionally that…
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 this paper we give new estimates for integrals involving some arithmetic functions defined over prime numbers. The main focus here is on the prime counting function $\pi(x)$ and the Chebyshev $\vartheta$-function. Some of these estimates…
Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…
In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…
In this paper, we shall study the stellar work of Norwegian mathematician Selberg and Hungarian mathematician Erd\H{o}s in providing an Elementary proof of the well-known \textit{Prime Number Theorem}. In addition to introducing ourselves…
The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…
By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…
We prove that the Riemann hypothesis is equivalent to the condition $\int_{2}^x\left(\pi(t)-\text{li}(t)\right)\mathrm{d}t<0$ for all $x>2$. Here, $\pi(t)$ is the prime-counting function and $\text{li}(t)$ is the logarithmic integral. This…
This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…
In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…
Ramanujan investigated maximal order for the number of divisors function by introducing some notion such as (superior) highly composite numbers. He also studied maximal order for other arithmetic functions including the sum of powers of…
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…
The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…
In this paper, we establish new explicit bounds for the Mertens function $M(x)$. In particular, we compare $M(x)$ against a short-sum over the non-trivial zeros of the Riemann zeta-function $\zeta(s)$, whose difference we can bound using…