Version: Nightly

For the complete Mojo documentation index, see llms.txt. Markdown versions of all pages are available by appending .md to any URL (e.g. /docs/manual/basics.md).

gcd

def gcd(m: Int, n: Int, /) -> Int

Compute the greatest common divisor of two integers.

Args:

m (Int): The first integer.
n (Int): The second integrer.

Returns:

Int: The greatest common divisor of the two integers.

def gcd(s: Span[Int], /) -> Int

Computes the greatest common divisor of a span of integers.

Args:

s (Span[Int]): A span containing a collection of integers.

Returns:

Int: The greatest common divisor of all the integers in the span.

def gcd(*values: Int) -> Int

Computes the greatest common divisor of a variadic number of integers.

Args:

*values (Int): A variadic list of integers.

Returns:

Int: The greatest common divisor of the given integers.