A prime prime primer

We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least. Instead of using a constant as was done by Legendre and others in the formula of Gauss, we try to adjust the data through a function. This function has the remarkable property: its points of discontinuity are the prime numbers.

This work consists of a heuristic study on the distribution of prime numbers in short intervals. We have modelled the occurrence of prime numbers such intervals as a counting experiment. As a result, we have provided an experimental validation and an extension of the Montgomery and Soundararajan conjecture. This is a reduced version of my bachelor`s thesis presented at the University of Valencia.

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 $\pi(10^{25})$.

We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is essentially the same as the one in Hardy and Wright. However, the second method is novel. It results in the same asymptotic formula but it uses a simpler correction factor than theirs. Though we have no theory for the accuracy of our estimates, ...

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

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 question for the order of the primes on the number line will be discussed.

This note provides an effective lower bound for the number of primes in the quadratic progression $p=n^2+1 \leq x$ as $x \to \infty$.

Formulas of $\pi(x)$-fine structure are presented.

In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a recursive relationship between primes of different ranges and so to describe some inner structure of this special set of numbers.

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime candidates are obtained in terms of the first perfect number. The asymptotic behaviour is also considered. We obtain for the first time an explicit relation for generating the full set P of prime numbers smaller than n or equal to n.