Find the greatest common divisor with the Euclidean algorithm. Every step is labeled with the rule it uses and rendered in proper math notation, so you can follow how the answer comes together. Type in your problem to start. Free to use, no account required.
gcd(48, 36) → 12