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