基于一种新筛子的Pi函数的算法实现
An algorithmic implementation of the Pi function based on a new sieve
摘要：
在本文中，我们提出了一个算法，正确地丢弃一组数字（从先前定义的筛子）与整数的间隔。Leopoldo定理指出，剩余的整数将生成并计数在感兴趣的区间内绝对值大于3的素数的完整列表。该算法避免了产生大的数字列表的问题，并且可以用于计算（即使是并行的）素数计数函数$π(h)$。
英文摘要：
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)$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
