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