A New Algorithm to Find Prime Numbers

Abstract

In this paper we explore a new approach to find any prime numbers up a fixed n 2 N. The proposed procedure does not run like a sieve and it is easy to implement, since it uses just assignments and subtractions. The algorithm and its extensions proposed give improvements about the memory requirement, with upgradeable runtime performances. Moreover, we note that our approach is very suitable for a parallel computing. These results solve, in our opinion, a lot of issues which many of sieves suffer, especially when large numbers are considered.