कुठलेही गणितीय प्रश्न सोडवा
तत्त्वज्ञान, अर्थशास्त्र, गणित, तत्त्वज्ञान,
चरणानुक्रमे
- \gcd(8, 12)
Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.
- 12 = 1 \times 8 + 4
Divide 12 by 8: quotient 1, remainder 4.
- 8 = 2 \times 4 + 0
Divide 8 by 4: quotient 2, remainder 0.
- \gcd(8, 12) = 4
The last non-zero remainder is 4.
उत्तर उघडा
\gcd(8, 12) = 4