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 zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
23883 | : | 12409 | = | 1 | remainder ( 11474 ) | ||||||||||||||||||
12409 | : | 11474 | = | 1 | remainder ( 935 ) | ||||||||||||||||||
11474 | : | 935 | = | 12 | remainder ( 254 ) | ||||||||||||||||||
935 | : | 254 | = | 3 | remainder ( 173 ) | ||||||||||||||||||
254 | : | 173 | = | 1 | remainder ( 81 ) | ||||||||||||||||||
173 | : | 81 | = | 2 | remainder ( 11 ) | ||||||||||||||||||
81 | : | 11 | = | 7 | remainder ( 4 ) | ||||||||||||||||||
11 | : | 4 | = | 2 | remainder ( 3 ) | ||||||||||||||||||
4 | : | 3 | = | 1 | 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.