Solve any maths problem
Equations, derivatives, integrals, matrices, triangles, primes, statistics, or a word problem the tutor breaks into parts.
Step by step
- \gcd(48, 18)
Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.
- 48 = 2 \times 18 + 12
Divide 48 by 18: quotient 2, remainder 12.
- 18 = 1 \times 12 + 6
Divide 18 by 12: quotient 1, remainder 6.
- 12 = 2 \times 6 + 0
Divide 12 by 6: quotient 2, remainder 0.
- \gcd(48, 18) = 6
The last non-zero remainder is 6.
Reveal the answer
\gcd(48, 18) = 6