Find Greatest Common Divisor of 10001 and 100083, using Euclidean algorithm.
Answer
The GCD of given numbers is 73.
Explanation
Step 1 :
Divide $ 100083 $ by $ 10001 $ and get the remainder
The remainder is positive ($ 73 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10001 $ by $ \color{blue}{ 73 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 73 }} $.
We can summarize an algorithm into a following table.
| 100083 | : | 10001 | = | 10 | remainder ( 73 ) | ||
| 10001 | : | 73 | = | 137 | remainder ( 0 ) | ||
| GCD = 73 | |||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator