The module provides functions related to the greatest common divisors of integers.
Return the greatest common divisor of 2 integers a and b.
If one of the arguments is negative, then the result may be negative.
Return the greatest common divisor of 2 integers a and b by binary gcd algorithm.
Return the greatest common divisor d of two integers x and y and u, v such that d = x * u + y * v. The returned value is a tuple (u, v, d).
Return the least common multiple of 2 given integers a and b. If both entries are zero, then it raises an exception.
Return a list [d, [c1, ..., cn]] for the given list integers=[x1, ..., xn]
such that
d = c1 * x1 + ... + cn * xn,
and of course d is the greatest common divisor of them.
Return True if a and b are coprime, False otherwise.
Return True if all integers in int_list are pairwise coprime, False otherwise.