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