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