TY  - GEN
T1  - An algorithmic implementation of the Pi function based on a new sieve
A1  - Gulich, Damián
A2  - Funes, Gustavo
A2  - Lofeudo, Nahuel
A2  - Garavaglia, Leopoldo
A2  - Garavaglia, Mario
LA  - English
UL  - http://vufind10-pruebas.sigbunlp.bibliotecas.unlp.edu.ar/Record/dif.56796
AB  - In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete list of primes of absolute value greater than 3 in the interval of interest. This algorithm avoids the problem of generating large lists of numbers, and can be used to compute (even in parallel) the prime counting function π(h).
ER  -