An algorithmic implementation of the Pi function based on a new sieve

Simple item page
dc.creatorGulich, Damian
dc.creatorFunes, Gustavo
dc.creatorLofeudo, Nahuel
dc.creatorGaravaglia, Leopoldo
dc.creatorGaravaglia, Mario
dc.date2008-02-26
dc.date2008-10-07
dc.date.accessioned2026-07-07T10:07:35Z
dc.date.available2026-07-07T10:07:35Z
dc.descriptionIn 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)$.
dc.description11 pages, 2 figures, 5 tables; added references, added historical context, corrected typos
dc.identifierhttps://arxiv.org/abs/0802.3770
dc.identifierhttp://arxiv.org/abs/0802.3770
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170690
dc.subjectGeneral Mathematics
dc.subject11Y11; 11N35; 11N36; 11Y55
dc.titleAn algorithmic implementation of the Pi function based on a new sieve
dc.typetext

Files

Collections

arXiv