Euclidean algorithm in Italian

(arithmetic, number theory) Specifically, a method, based on a division algorithm, for finding the greatest common divisor (gcd) of two given integers; any of certain variations or generalisations of said method.