pith. sign in

arxiv: 0711.3940 · v2 · submitted 2007-11-26 · 🧮 math.NT

A recursion equation for prime numbers

classification 🧮 math.NT
keywords limitsequationfracinftynumbersprimerecursiondetermine
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.