Otro
Extended euclidean algorithm
Autor
Porubský, Štefan
Trott, Michael
Resumen
none The greatest common divisor of two integers a and b can be found by the Euclidean algorithm by successive repeated application of the division algorithm. The extended Euclidean algorithm not only computes gcd(a,b) but also returns the numbers s and t such that gcd(a,b)=as+bt Componente Curricular::Ensino Fundamental::Séries Finais::Matemática