Euclidean algorithm

Home > Mathematics > Number theory > Chinese remainder theorem > Euclidean algorithm

This is one of the algorithms used to calculate the GCD of two numbers. It involves a series of successive divisions and is an efficient method for finding the GCD.