A new formula for the nth prime

Differentiable real function reproducing primes up to a given number and having a differentiable inverse function is constructed. This inverse function is compared with the Riemann-Von Mangoldt exact expression for the number of primes not exceeding a given value. Software for computation of the direct and inverse functions and their derivatives is developed. Examples of approximate solution of Diophantine equations on the primes are given.

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.

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 complexity $\mathcal{O}(x^{1/2})$ without the need to introduce the non-trivial zeros of the Riemann zeta function.

74 new integer sequences are introduced in number theory, and for each of them is given a characterization, followed by open problems. each one a general question: how many primes each sequence has.

In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$ semiprime and the next semiprime to a given number. The new formulas are based on the knowledge of the primes less than or equal to the cube roots of $N : P_{1}, \; P_{2}....P_{\pi \left( \sqrt[3]{N}\right) }\leq \sqrt[3]{N}$.

We introduce a new set of prime numbers functions including an exact Generating Function and a Discriminating Function of Prime Numbers neither based on prime number tables nor on algorithms. Instead these functions are defined in terms of ordinary elementary functions, therefore having the advantage of being analytic and readily calculable. Also presented are four applications of our new Prime Numbers Generating Function, namely: obtaining a new analytic formula for 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 \geq x_0$. Then we give some new results concerning the existence of prime numbers in short intervals. Also we derive new upper and lower bounds for some functions defined over prime numbers, for instance the prime counting function $\pi(x...

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 small intervals.

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of these approximations

This short paper presents an exact formula for counting twin prime pairs less than or equal to x in terms of the classical Smarandache Function. An extension of the formula to count prime pairs (p, p+2n), n > 1, is also given.