Open Access
Research Article·pp. 1213–1236·Vol. 26, Issue 4Jun 2023
A new algorithm to find prime numbers with less memory requirements
Daniele Bufalo, Michele Bufalo, Giuseppe Orlando, Raffaele Tetta
Published Online: 21 Aug 2023DOI: 10.47974/JDMSC-1629
In this paper: 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 subt...
