alleryIn the Euclidean algorithm, the pair (a, b) is repeatedly replaced by which pair?
A(a + b, b)
B(b, a / b)
C(a x b, b)
D(b, a mod b)
Answer & Solution
Correct answer: D. (b, a mod b)
Each step swaps in the remainder of dividing a by b until the remainder is 0.
Keep practising LCM and HCF
Browse all LCM and HCF questions for RRB NTPC, or explore more Mathematics topics.
Related questions
RRB NTPC · HCF and LCM CalculationsFind the Least Common Multiple (LCM) of the numbers 12 and 18:Find the Highest Common Factor (HCF) of 24 and 36:RRB NTPC · Find LCM of Number PairsFor a > b, common divisors of a and b are identical to common divisors of b andFor any positive integer a, what is the value of gcd(a, a)?How is the least common multiple of a and b computed using their GCD?Two positive integers are coprime or relatively prime if their GCD equals