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