Step-by-step solution for Division
View the challenge

This challenge requires you to find the greatest common divisor of two numbers. We'll solve this challenge using the famous Euclidean algorithm. It works by repeatedly taking the modulus of both numbers and replacing ing one the parameters with the new number.

You need to be a member to see the rest of this solution and code.