**is_gaussian_prime**,
a Python code which
determines whether a complex number c is a Gaussian prime.

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

**is_gaussian_prime** is available in
a MATLAB version and
a Python version.

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

gaussian_prime_spiral, a Python code which computes a twisting spiral path along the Gaussian primes, and displays a plot of the total trajectory.

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

is_prime, a Python code which is true if a given integer n is prime.

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

- is_gaussian_prime.py, the source code.
- is_gaussian_prime.sh, runs all the tests.
- is_gaussian_prime.txt, the output file.