is_gaussian_prime, an Octave 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 an Octave version and a Python version.
euclid, an Octave code which investigates various versions of Euclid's algorithm for computing the greatest common divisor (GCD) of two integers.
gaussian_prime_spiral, an Octave code which computes a twisting spiral path along the Gaussian primes, and displays a plot of the total trajectory.
i4lib, an Octave code which contains many utility routines, using integer arithmetic.
is_prime, an Octave code which is true if a given integer n is prime.
polpak, an Octave 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.