The GCD of given numbers is 325.
Step 1 :
Divide $ 1625 $ by $ 975 $ and get the remainder
The remainder is positive ($ 650 > 0 $), so we will continue with division.
Step 2 :
Divide $ 975 $ by $ \color{blue}{ 650 } $ and get the remainder
The remainder is still positive ($ 325 > 0 $), so we will continue with division.
Step 3 :
Divide $ 650 $ by $ \color{blue}{ 325 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 325 }} $.
We can summarize an algorithm into a following table.
| 1625 | : | 975 | = | 1 | remainder ( 650 ) | ||||
| 975 | : | 650 | = | 1 | remainder ( 325 ) | ||||
| 650 | : | 325 | = | 2 | remainder ( 0 ) | ||||
| GCD = 325 | |||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.