A Functional Recurrence to obtain the Prime Numbers using the Smarandache Prime Function

2004/07/15 by Sebastian Martin Ruiz
Mathematics · #math.GM #msc:11A41

paper · pdf

published as Smarandache Notions Journal. Vol. 11 No. 1-2-3 Spring 2000 p. 56 · 3 pages

arxiv created 2004/07/15 · arxiv updated 2009/12/01

Abstract

In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.

Related

• The Classical Smarandache Function and a Formula for Twin Primes
• A function to calculate all relative prime numbers up to the product of\n the first n primes
• The prime counting function
• A new formula for the nth prime
• The Prime Number Formula of Gandhi