A Functional Recurrence to obtain the Prime Numbers using the Smarandache Prime Function
Sebastian Martin Ruiz
math.GMarXiv:math/0407267
Abstract
In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.
Create a lesson
Related papers
Construction, Enumeration and Duality of Perfectly Balanced Musical Sets of Order 2pq
Paul Lascabettes, Sidney Ali, Alexandre Popoff et al.
Boundary phenomena for slow recurrences:finite and infinite critical sets
Mohsen Aliabadi
Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers
Alex Shvets
How Does One Cut a 30-60-90 Triangle?
Ed Pegg, Brian Trease, Andrew Hudson et al.
A Computational Verification of the Markov Uniqueness Conjecture for z≤ 10500000
Hu Tan, Ying Zhang
On Some Special Cases of the Weber-Schafheitlin Integral
V. G. Zborovskii