Related papers: A new bound for the smallest $x$ with $\pi(x) > li…

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…

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

We generalise Zhang's and Pintz recent results on bounded prime gaps to give a lower bound for the the number of prime pairs bounded by 6*10^7 in the short interval $[x,x+x (\log x)^{-A}]$. Our result follows only by analysing Zhang's proof…

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…

It is well known that $li(x)>\pi(x)$ (i) up to the (very large) Skewes' number $x_1 \sim 1.40 \times 10^{316}$ \cite{Bays00}. But, according to a Littlewood's theorem, there exist infinitely many $x$ that violate the inequality, due to the…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

It is shown that for any fixed $i>0$, the $\Sigma_{i+1}$-fragment of Presburger arithmetic, i.e., its restriction to $i+1$ quantifier alternations beginning with an existential quantifier, is complete for…

By combining a sieve method of Harman with the work of Maynard and Tao we show that $$\liminf_{n\rightarrow \infty}(p_{n+m}-p_n)\ll \exp(3.815m).$$

We improve the lower bound for $V(T)$, the number of sign changes of the error term $\psi(x)-x$ in the Prime Number Theorem in the interval $[1,T]$ for large $T$. We show that \[ \liminf_{T\to\infty}\frac{V(T)}{\log…

We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of…

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…

We give an explicit version of Brun-Titchmarsh theorem applicable for arbitrary moduli and arbitrary intervals. For example, we show that $\pi(x+y; k, a)-\pi(x; k, a)<2y/(\varphi(k)(\log (y/k)+0.8601))$ for any relatively prime positive…

We show that, for almost all $x$, the interval $(x, x+(\log x)^{2.1}]$ contains products of exactly two primes. This improves on a work of the second author that had $3.51$ in place of $2.1$. To obtain this improvement, we prove a new type…

We show the following bounds on the prime counting function $\pi(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{\pi(x)}{x / \log x} \geq \liminf_{x \rightarrow…

95 years ago Hoheisel proved the existence of primes in the sub-linear interval \[ \left[x, x+x^{1-{1\over 33000}}\right] \qquad \hbox{for $x$ sufficiently large}. \] This was improved by Heilbronn, proving existence of primes in the…