A much more efficient method is the Euclidean algorithm, which uses the division algorithm in combination with the observation that the gcd of two numbers also divides their difference: divide 48 by 18 to get a quotient of 2 and a remainder of 12.
To compute gcd (48,18), divide 48 by 18 to get a quotient of 2 and a remainder of 12. A much more efficient method is the Euclidean algorithm, which uses the division algorithm in combination with the observation that the gcd of two numbers also divides their difference.
A much more efficient method is the Euclidean algorithm, which uses the division algorithm in combination with the observation that the gcd of two numbers also divides their difference. To compute gcd (48,18), divide 48 by 18 to get a quotient of 2 and a remainder of 12.
A much more efficient method is the Euclidean algorithm, which uses the division algorithm in combination with the observation that the gcd of two numbers also divides their difference. To compute gcd (48,18), divide 48 by 18 to get a quotient of 2 and a remainder of 12.