The GCD of given numbers is 1.
Step 1 :
Divide by and get the remainder
The remainder is positive (), so we will continue with division.
Step 2 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 3 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 4 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 5 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 6 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 7 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 8 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 9 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 10 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 11 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
32321 | : | 26513 | = | 1 | remainder ( 5808 ) | ||||||||||||||||||||
26513 | : | 5808 | = | 4 | remainder ( 3281 ) | ||||||||||||||||||||
5808 | : | 3281 | = | 1 | remainder ( 2527 ) | ||||||||||||||||||||
3281 | : | 2527 | = | 1 | remainder ( 754 ) | ||||||||||||||||||||
2527 | : | 754 | = | 3 | remainder ( 265 ) | ||||||||||||||||||||
754 | : | 265 | = | 2 | remainder ( 224 ) | ||||||||||||||||||||
265 | : | 224 | = | 1 | remainder ( 41 ) | ||||||||||||||||||||
224 | : | 41 | = | 5 | remainder ( 19 ) | ||||||||||||||||||||
41 | : | 19 | = | 2 | remainder ( 3 ) | ||||||||||||||||||||
19 | : | 3 | = | 6 | remainder ( 1 ) | ||||||||||||||||||||
3 | : | 1 | = | 3 | remainder ( 0 ) | ||||||||||||||||||||
GCD = 1 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.