kone.algebraicExtra/dev.lounres.kone.numberTheory/gcd

gcd

tailrec fun gcd(a: Int, b: Int): Int(source)
tailrec fun gcd(a: Long, b: Long): Long(source)

Computes Greatest Common Divisor of a and b.

It's computed by Euclidean algorithm. Hence, its time complexity is \(O(\log(a+b))\) (see Wolfram MathWorld).

fun gcd(vararg values: Int): Int(source)
fun gcd(values: KoneIterable<Int>): Int(source)
fun gcd(vararg values: Long): Long(source)
fun gcd(values: KoneIterable<Long>): Long(source)

Computes Greatest Common Divisor of the values.

tailrec fun <N> gcd(a: N, b: N): N(source)
fun <N> gcd(vararg values: N): N(source)
fun <N> gcd(values: KoneIterable<N>): N(source)