Formula for the Nth Prime Number

@article{Jones1975FormulaFT,
  title={Formula for the Nth Prime Number},
  author={James P. Jones},
  journal={Canadian Mathematical Bulletin},
  year={1975},
  volume={18},
  pages={433 - 434}
}
  • James P. Jones
  • Published 1 August 1975
  • Mathematics
  • Canadian Mathematical Bulletin
In this note we give a simple formula for the nth prime number. Let pn denote the nth prime number (p 1=2, p 2 = 3, etc.). We shall show that p n is given by the following formula. 
View on Cambridge Press
12 Citations
Highly Influential Citations
2
Background Citations
2
Methods Citations
1

12 Citations

New explicit formulae for the prime counting function
In the paper new explicit formulae for the prime counting function π are proposed and proved. They depend on arbitrary positive arithmetic function which satisfies certain condition. As a particular…
Finding Prime Numbers as Fixed Points of Sequences
In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over…
A Natural Prime-Generating Recurrence
For the sequence defined by a(n) = a(n − 1) + gcd(n, a(n − 1)) with a(1) = 7 we prove that a(n) − a(n − 1) takes on only 1’s and primes, making this recurrence a rare “naturally occurring” generator…
Prime numbers
In my talk I will pose several questions about prime numbers. We will see that on the one hand some of them allow an answer with a proof of just a few lines, on the other hand, some of them lead to…
Experimental methods applied to the computation of integer sequences
TLDR
The experimental method is applied to certain problems in number theory and combinatorics to understand certain integer sequences, and the recurrence an=an-1 +gcdn,an- 1 , which is shown to generate primes in a certain sense.
DIOPHANTINE REPRESENTATION OF THE SET OF PRIME NUMBERS
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and…
Some Smarandache Problems
During the five years since publishing [2], we have obtained many new results related to the Smarandache problems. We are happy to have the opportunity to present them in this book for the enjoyment…
Metamathematics of First-Order Arithmetic by Petr Hájek
A remark on an arithmetic function. Part 3
The many facets of euler’s totient
...
...

References

SHOWING 1-4 OF 4 REFERENCES
On Formulae for the nth Prime Number
Let pn denote the nth prime number. (p 1=2, p 2 = 3, etc.) Let [x] denote the greatest integer which is not greater than x. From Wilson’s theorem, is an integer for x = 1 and for all prime values of…
Formulae For Primes
The criticism by T. B. M. Neil and M. Singer in The Gazette for October 1965 of C. P. Willans’ formula for the nth prime number is in my view quite unjust. Willans’ formula expresses two properties…
Approximate formulas for some functions of prime numbers
History of a Formula for Primes