A new simple recursive algorithm for finding prime numbers using Rosser's theorem

Abstract : In our previous work (The distribution of prime numbers: overview of n.ln(n), (1) and (2)) we defined a new method derived from Rosser's theorem (2) and we used it in order to approximate the nth prime number. In this paper we improve our method to try to determine the next prime number if the previous is known. We use our method with five intervals and two values for n (see Methods and results). Our preliminary results show a reduced difference between the real next prime number and the number given by our algorithm. However long-term studies are required to better estimate the next prime number and to reduce the difference when n tends to infinity. Indeed an efficient algorithm is an algorithm that could be used in practical research to find new prime numbers for instance.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [1 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01472833
Contributor : Rédoane Daoudi <>
Submitted on : Tuesday, February 21, 2017 - 1:02:09 PM
Last modification on : Wednesday, September 5, 2018 - 1:30:09 PM
Document(s) archivé(s) le : Monday, May 22, 2017 - 3:16:32 PM

Files

Nombres_premiers_2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01472833, version 1

Collections

Citation

Rédoane Daoudi. A new simple recursive algorithm for finding prime numbers using Rosser's theorem. 2017. ⟨hal-01472833⟩

Share

Metrics

Record views

323

Files downloads

362