A recursion equation for prime numbers

Abstract

It is shown that the first n prime numbers p1,...,pn determine the next one by the recursion equation pn+1 =s +∞ [Πnk=1 (1-1psk) Σ∞j=1 1js -1]-1/s. The upper limit on the sum can be replaced by 2pn -1, and the result still holds.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…