Find Greatest Common Divisor of 6666600000 and 6666666666, using Euclidean algorithm.
Answer
The GCD of given numbers is 66666.
Explanation
Step 1 :
Divide $ 6666666666 $ by $ 6666600000 $ and get the remainder
The remainder is positive ($ 66666 > 0 $), so we will continue with division.
Step 2 :
Divide $ 6666600000 $ by $ \color{blue}{ 66666 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 66666 }} $.
We can summarize an algorithm into a following table.
| 6666666666 | : | 6666600000 | = | 1 | remainder ( 66666 ) | ||
| 6666600000 | : | 66666 | = | 100000 | remainder ( 0 ) | ||
| GCD = 66666 | |||||||
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