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