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

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

2008-02-26

arxiv.org/abs/0802.3770v2

Mathematics

General Mathematics

11 pages, 2 figures, 5 tables; added references, added historical context, corrected typos

Scientific paper

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 $\pi(h)$.

Affiliated with

Also associated with

No associations

Rating

An algorithmic implementation of the Pi function based on a new sieve does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithmic implementation of the Pi function based on a new sieve, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithmic implementation of the Pi function based on a new sieve will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24948