//ERDDAP/com.cohort.util/ScriptMath2/gcd

gcd

[JVM]
open fun gcd(n: Int, d: Int): Int

Finds the greatest common divisor.

• Euclidean greatest common divisor algorithm.
• If either is 0, it returns 1.
• For example, gcd(18,30) returns 6.