相关论文: Formulas for pi(n) and the n-th 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…

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…

Plouffe conjectured rapidly converging series formulas for $\pi^{2n+1}$ and $\zeta (2n+1)$ for small values of $n$. We find the general pattern for all nonnegative integer values of $n$ and offer a proof.

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

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…

In this paper we establish a number of new estimates concerning the prime counting function \pi(x), which improve the estimates proved in the literature. As an application, we deduce a new result concerning the existence of prime numbers in…

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

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 establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

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…

A method for computing the n'th decimal digit of pi in O(n^3 log(n)^3) time and with very little memory is presented here. The computation is based on the recently discovered Bailey-Borwein-Plouffe algorithm and the use of a new algorithm…

Bertrand's postulate establishes that for all positive integers $n>1$ there exists a prime number between $n$ and $2n$. We consider a generalization of this theorem as: for integers $n\geq k\geq 2$ is there a prime number between $kn$ and…

This article is about Pi Formulas, infinite series of fractions which sum to multiples of Pi. Each such one can be associated with a unique set $S_k$ of rough numbers, where $k$ is a prime number. Given $S_k$ for any prime $k$, the set…

For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…

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) =…

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

We present an improved version of the analytic method for calculating $\pi(x)$, the number of prime numbers not exceeding $x$. We implemented this method in cooperation with J. Franke, T. Kleinjung and A. Jost and calculated the value…

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…