कुठलेही गणितीय प्रश्न सोडवा
Equations, derivatives, integrals, matrices, triangles, primes, statistics, or a word problem the tutor breaks into parts.
चरणानुक्रमे
- \gcd(84, 126)
Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.
- 126 = 1 \times 84 + 42
Divide 126 by 84: quotient 1, remainder 42.
- 84 = 2 \times 42 + 0
Divide 84 by 42: quotient 2, remainder 0.
- \gcd(84, 126) = 42
The last non-zero remainder is 42.
उत्तर उघडा
\gcd(84, 126) = 42