Euclide's algorithm (illustration)

Using the Euclide's algorithm computes the greatest common divisor between $24$ and $10$.

Resolution:

Using the integer division algorithm repeatedly we can easily conclude that:

Therefore, because the remainder of the division betwwen $\color{blue}{4}$ and $\color{red}{2}$ is 0, the greatest common divisor between $24$ and $10$ is $2$.