prime_pi

prime_pi, a MATLAB code which evaluates Pi(n), the number of primes less than or equal to an integer n.

Licensing:

The computer code and data files made available on this web page are distributed under the MIT license

Languages:

prime_pi is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

prime_pi_test

euclid, a MATLAB code which investigates various versions of Euclid's algorithm for computing the greatest common divisor (GCD) of two integers.

i4lib, a MATLAB code which contains many utility routines, using integer arithmetic.

is_prime, a MATLAB code which implements various versions of the sieve of Eratosthenes to determine whether a given integer is prime.

polpak, a MATLAB code which evaluates a variety of mathematical functions, polynomials, and sequences, including Bell, Benford, Bernoulli, Bernstein, Cardan, Catalan, Charlier, Chebyshev, Collatz, Delannoy, Euler, Fibonacci, Gegenbauer, Gudermannian, Harmonic, Hermite, Hofstadter, Jacobi, Krawtchouk, Laguerre, Lambert, Legendre, Lerch, Meixner, Mertens, Moebius, Motzkin, Phi, Stirling, Tau, Tribonacci, Zernike.

Source Code:

• prime_pi3.m, determines whether an integer is prime.
• prime_pi1.m, counts the number of primes less than or equal to n, using the is_prime3() function.
• prime_pi2.m, counts the number of primes less than or equal to n, using MATLAB's isprime() function.