Find LCM and GCD of two numbers
The GCD (Greatest Common Divisor) is the largest number that divides two numbers exactly, usually found using the Euclidean algorithm. The LCM (Least Common Multiple) is the smallest number that both numbers divide into evenly.