相关论文: Formulas for pi(n) and the n-th prime

This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

We assume the permutation $\pi$ is given by an $n$-element array in which the $i$-th element denotes the value $\pi(i)$. Constructing its inverse in-place (i.e. using $O(\log{n})$ bits of additional memory) can be achieved in linear time…

In this article, we derive a Euler prime product formula for the magnitude of the Riemann zeta function $\zeta(s)$ valid for $\Re(s)>1$, as well as similar formulas for $\zeta(s)$ valid for an even and odd $k$th positive integer argument.…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

Fix a prime $p \ge 5$ and define $g(2n,p)=\#\{(h,k)\in\mathbb{Z}_{>0}^2 : h+k=2n,\; h\le k,\; \gcd(h,6p)=\gcd(k,6p)=1\}$. We derive explicit closed-form expressions for $g(2n,p)$ in terms of the canonical remainder operator…

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

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 present a new form of the Machin-like formula for $\pi$ that can be generated by using iteration. This form of the Machin-like formula may be promising for computation of the constant $\pi$ due to rapidly increasing integers at each step…

Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

The search for a closed-form expression of the $n$-th prime number, $p_n$, has long oscillated between the rigid determinism of analytic functions and the apparent randomness of local distributions. This paper explores three different…

With the formula of Gandhi you can determine the on $p_n$ immedately subsequent prime $p_{n+1}$ from the knowledge of the primes $p_1, p_2, ... , p_n$. An elementary proof of its trueness will be detailed shown in this paper. Finally the…

Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

In this paper we propose a new method for determination of the two-term Machin-like formula for pi with arbitrarily small arguments of the arctangent function. This approach excludes irrational numbers in computation and leads to a…

We give the definition, main properties and integral expressions of the auxiliary function of Riemann $\mathop{\mathcal R }(s)$. For example we prove $$\pi^{-s/2}\Gamma(s/2)\mathop{\mathcal R }(s)=-\frac{e^{-\pi i s/4}}{…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…