shared/io.github.gatrongdev.kbignum.math/KBigMath/gcd

gcd

fun gcd(a: KBigInteger, b: KBigInteger): KBigInteger

Calculates the greatest common divisor (GCD) of two KBigIntegers using Euclid's algorithm. The GCD is the largest positive integer that divides both numbers without remainder.

Return

The greatest common divisor of a and b

Parameters

a

The first KBigInteger

b

The second KBigInteger