Extended greatest common divisor: Introduction to the GCD and LCM (greatest common divisor and least common multiple) (subsection GCDandLCM/01)

ExtendedGCD

$Mathematica Notation$

Integer Functions

ExtendedGCD[n₁,n₂,...,n_m]

Introduction to the GCD and LCM (greatest common divisor and least common multiple)

General

The legendary Greek mathematician Euclid (ca. 325–270 BC) suggested an algorithm for finding the greatest common divisor of two integers, which was later named the Euclidean algorithm. This algorithm, as well as computationally refined versions, are in widespread use today.