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