The GCD of given numbers is 12.
Step 1 :
Divide $ 528 $ by $ 324 $ and get the remainder
The remainder is positive ($ 204 > 0 $), so we will continue with division.
Step 2 :
Divide $ 324 $ by $ \color{blue}{ 204 } $ and get the remainder
The remainder is still positive ($ 120 > 0 $), so we will continue with division.
Step 3 :
Divide $ 204 $ by $ \color{blue}{ 120 } $ and get the remainder
The remainder is still positive ($ 84 > 0 $), so we will continue with division.
Step 4 :
Divide $ 120 $ by $ \color{blue}{ 84 } $ and get the remainder
The remainder is still positive ($ 36 > 0 $), so we will continue with division.
Step 5 :
Divide $ 84 $ by $ \color{blue}{ 36 } $ and get the remainder
The remainder is still positive ($ 12 > 0 $), so we will continue with division.
Step 6 :
Divide $ 36 $ 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.
| 528 | : | 324 | = | 1 | remainder ( 204 ) | ||||||||||
| 324 | : | 204 | = | 1 | remainder ( 120 ) | ||||||||||
| 204 | : | 120 | = | 1 | remainder ( 84 ) | ||||||||||
| 120 | : | 84 | = | 1 | remainder ( 36 ) | ||||||||||
| 84 | : | 36 | = | 2 | remainder ( 12 ) | ||||||||||
| 36 | : | 12 | = | 3 | remainder ( 0 ) | ||||||||||
| GCD = 12 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.