A recursion equation for prime numbers

arXiv0711.3940MaRDI QIDQ6207613FDOQ6207613

Authors: Joseph B. Keller 

Publication date: 26 November 2007

Abstract: It is shown that the first $n$ prime numbers $p_1,\mathrm{...},p_n$ determine the next one by the recursion equation ${\displaystyle }$ p_{n+1} =limlimits_{s o +infty} [prodlimits^n_{k=1} (1-frac{1}{p^s_k}) sumlimits^infty_{j=1} frac{1}{j^s} -1]^{-1/s}. ${\displaystyle }$ The upper limit on the sum can be replaced by $2p_n-1$, and the result still holds.

Mathematics Subject Classification ID

Primes (11A41)

This page was built for publication: A recursion equation for prime numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207613)