Documentation / @ripl/utilities / numberGCD

Function: numberGCD()

numberGCD(valueA, valueB): number

Defined in: packages/utilities/src/number.ts:68

Computes the greatest common divisor of two integers using the Euclidean algorithm.

Parameters

Parameter	Type
valueA	number
valueB	number

Returns

number