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

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

**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.

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

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

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

polpak, a Fortran90 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.

- prime_pi.f90, the source code.
- prime_pi.sh, compiles the source code.