Tag Archives: Euclid

Calculate the GCD (greatest common divisor) and LCM (least common multiple) of two integers in C#

GCD The greatest common divisor of two integers is the largest integer that evenly divides them both. For example, GCD(180, 105) = 15 because 15 is the largest integer that divides evenly into both 180 and 105. Euclid’s Elements c. … Continue reading

Posted in algorithms, mathematics | Tagged , , , , , , , , , , , , | 4 Comments