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