Read Edit View history 欧几里得算法 ōujǐlǐdésuànfǎ Euclidean algorithm Origin Definitions Defs Strokes Stroke Words Sentences Sents Senses Add sense 欧几里得算法/ 歐幾里得算法 ōujǐlǐdésuànfǎ Euclidean algorithm an efficient method for computing the greatest common divisor of two integers by repeatedly replacing the larger number with the remainder of its division by the smaller number Edit Delete References Add reference same_as 辗转相除法/輾轉相除法 → 欧几里得算法/歐幾里得算法 Edit Delete
欧几里得算法/ 歐幾里得算法 ōujǐlǐdésuànfǎ Euclidean algorithm an efficient method for computing the greatest common divisor of two integers by repeatedly replacing the larger number with the remainder of its division by the smaller number Edit Delete