# Euclid

- gcd_euclid [edit] v0.1
*Find the greatest common divisor (also known as the greatest common factor or highest common factor) of two numbers using the Euclidean algorithm.* - lcm [edit] v0.1
*Find the least common multiple (a.k.a. lowest common multiple, smallest common multiple or lowest common denominator) of two numbers.*