A prime prime primer

While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the primes tick.' Here, we suggest that a resolution to this long-standing conundrum is attainable by defining the primes prior to the natural numbers - as opposed to the standard number theoretical definition of primes where these numbers derive...

We study values of k for which the interval (kn,(k+1)n) contains a prime for every n>1. We prove that the list of such integers k includes k=1,2,3,5,9,14, and no others, at least for k<=50,000,000. For every known k of this list, we give a good upper estimate of the smallest N_k(m), such that, if n>=N_k(m), then the interval (kn,(k+1)n) contains at least m primes.

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.

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 upper limit on the sum can be replaced by $2p_n -1$, and the result still holds.

In the conference paper we construct analouge to Pascal's triangle that characterize primes with additional fascinating properties.

An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate /pi(N).

Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture, develop a simple heuristic and rederive these classic estimates. We then apply them to several special forms of primes and compare the estimates with the actual numbers.

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.

We will derive a function that eliminates any sequence of equidistant numbers from the integer numbers, then we will derive its inverse. Then we will use the Sequence elimination function to eliminate the multiples of the prime numbers from the integer numbers to produce formulas that generate all prime numbers in some interval.

The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and circle problem.