Greatest common divisor algorithms This is a mathematical problem, where the solution is the highest commmon factor of two input numbers. For example, 5 is the highest common factor of 15 and 35.

A program that calculates the greatest common divisor and least common multiple of 2 numbers requested as input from the user.