Greatest common divisor

Syntax

gcd(Number1, Number2)

gcd(List1, List2)

gcd(Matrix1, Matrix2)

Examples

Greatest Common Divisor and Least Common Multiple

The commands `gcd` and `lcm` are used to compute the greatest common divisor and the least common multiple of integers.

gcd, lcm

Diophantine equation

There is no dedicated command for solving a Diophantine equation, but the integer n1 can be used to construct and verify a solution. The integer constant can be entered from the keyboard as @n1, where 1 is an index used to distinguish multiple integer constants.

gcd, solve, @n, |