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