var Euclid = {};

Euclid.gcd = function greatestCommonDivisor( a, b) {

    "use strict";

    var lilNum, bigNum, modulo;

    lilNum = Math.min( a, b);
    bigNum = Math.max( a, b);

    modulo = bigNum % lilNum;

    if (modulo !== 0) {
        return this.gcd(modulo, lilNum);
    }
    else {
        return lilNum;
    }
}