A new algorithm to find prime numbers with less memory requirements

In this paper, we suggest a new approach to find any prime numbers up to a given n ∈ ℕ*. The proposed procedure does not work like a sieve and is easy to implement as it only uses assignments and subtractions which lead to improvements in memory requirements and upgradeable runtime performance. This is because, also, the algorithm suits well parallel computing. These results aim to solve several problems affecting those routines based on sieve methods, especially when large numbers are considered.