euclid

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

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

euclid is available in a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

euclid_test

i4lib, an Octave code which contains many utility routines, using integer arithmetic.

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.

Source Code:

• gcd1.m, implements Euclid's algorithm using subtraction.
• gcd2.m, implements Euclid's algorithm using the modulo function.