Related papers: On Proving Ramanujan's Inequality using a Sharper …

Let $\theta(x) = \sum_{p\leq x} \log p$. We show that $\theta(x)<x$ for $2<x< 1.39\cdot 10^{17}$. We also show that there is an $x<\exp(727.951332668)$ for which $\theta(x) >x.$

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\epsilon>0$, there is a positive…

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…

A highly strong upper estimate in the modified asymptotic formula for sums of the primes' reciprocals is proved to be necessary (as well as sufficient) in order the Ramanujan inequality holds true. Some other criteria in similar terms are…

It is commonly believed that the normalized gaps between consecutive ordinates $t_n$ of the zeros of the Riemann zeta function on the critical line can be arbitrarily large. In particular, drawing on analogies with random matrix theory, it…

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…

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…

Re presenting the traditional proof of Srinivasa Ramanujan's own favorite series for the reciprocal of $\pi$ :\begin{equation}\frac{1}{\pi} = \frac{\sqrt{8}}{9801} \sum_{n=0}^{+\infty} \frac{(4n)!}{(n!)^4} \frac{1103 + 26390n}{396^{4n}} \;…

In this article, we provide explicit bounds for the prime counting function $\theta(x)$ in all ranges of $x$. The bounds for the error term for $\theta (x)- x$ are of the shape $\epsilon x$ and $\frac{c_k x}{(\log x)^k}$, for…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

Using the log-convexity of the Gamma function and Euler's reflection formula, we give a new proof of a classical weighted sine product inequality. Two different parameter choices yield two competing upper bounds for the same product. We…

In this paper, we are going to prove a famous problem concerning prime numbers. Bertrand postulate states that there is always a prime p with n < p < 2n, if n > 1. Bertrand postulate is not a newer one to be proven, in fact, after his…

Lehmer conjectured that Ramanujan's tau-function never vanishes. In a related direction, a folklore conjecture asserts that infinitely many primes arise as absolute values of Ramanujan's tau-function. Recently, Xiong showed that these prime…

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…

We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…

We prove continuity and Harnack's inequality for bounded solutions to the equation $$ {\rm div}\big(|\nabla u|^{p(x)-2}\,\nabla u \big)=0, \quad p(x)= p + L\frac{\log\log\frac{1}{|x-x_{0}|}}{\log\frac{1}{|x-x_{0}|}},\quad L > 0, $$ under…

In this note, we show that there are many infinity positive integer values of $n$ in which, the following inequality holds $$ \left\lfloor{1/2}(\frac{(n+1)^2}{\log(n+1)}-\frac{n^2}{\log n})-\frac{\log^2 n}{\log\log…

In this note, we prove that for all $x \in (0 , 1)$, we have: $$ \log\Gamma(x) = \frac{1}{2} \log\pi + \pi \boldsymbol{\eta} \left(\frac{1}{2} - x\right) - \frac{1}{2} \log\sin(\pi x) + \frac{1}{\pi} \sum_{n = 1}^{\infty} \frac{\log n}{n}…

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…