You searched for: divisor (Koreanska - Engelska)

mod(dividend; divisor)
mod(dividend; divisor)

calculate greatest common divisor of a and b. the result is always positive even if either of, or both, input operands are negative.
the result is always positive even if either of, or both, input operands are negative.

calculates g, s, and t, such that a*s + b*t = g = gcd(a,b), where gcd is the greatest common divisor. returns an array with respective elements g, s and t.
returns an array with respective elements g, s and t.