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.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Contributeur : Rédoane Daoudi <>
Soumis le : mardi 21 février 2017 - 13:02:09
Dernière modification le : jeudi 23 février 2017 - 01:09:44
Document(s) archivé(s) le : lundi 22 mai 2017 - 15:16:32


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01472833, version 1



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



Consultations de
la notice


Téléchargements du document