is_prime

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

Licensing:

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

Languages:

is_prime 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 and an R version.

Related Data and Programs:

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

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:

• is_prime1.m, a simple version of the algorithm checking divisors 2 through n-1.
• is_prime2.m, a version of the algorithm checking divisors 2 through sqrt(n).
• is_prime3.m, a version of the algorithm checking divisors of the form 6k-1 and 6k+1.