Beginner
Discrete Mathematics & Math
Q22 / 100
What is the GCD (Greatest Common Divisor)?
Correct! Well done.
Incorrect.
The correct answer is B) The largest positive integer that divides both a and b without remainder
B
Correct Answer
The largest positive integer that divides both a and b without remainder
Explanation
GCD(12,8) = 4. Computed by the Euclidean algorithm: GCD(a,b) = GCD(b, a mod b). Fundamental for fractions, modular inverse, and Euclidean algorithm-based cryptography.
Progress
22/100