Extended Euclidean Algorithm

Home > Mathematics > Number theory > Greatest common divisor (GCD) > Extended Euclidean Algorithm

Also known as the Bezout's Identity Algorithm, it is used to find a pair of numbers that will satisfy a given linear Diophantine equation.