static gcd (a, b) {
    while (b !== 0) {
      let h = a % b
      a = b
      b = h
    }
    return a
  }
/**
   * Applies the Euclidean algorithm for computing the greatest
   * common divisor of two integers.
   * @param {number} a
   * @param {number} b
   * @return {number}
   */
Applies the Euclidean algorithm for computing the greatest
common divisor of two integers.
Applies the Euclidean algorithm for computing the greatest common divisor of two integers .
static gcd (a, b) {
    while (b !== 0) {
      let h = a % b
      a = b
      b = h
    }
    return a
  }
static gcd ( a , b ) { while ( b !== 0 ) { let h = a % b a = b b = h } return a }
Applies the Euclidean algorithm for computing the greatest
 common divisor of two integers.
Applies the Euclidean algorithm for computing the greatest common divisor of two integers .