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