For a > b, common divisors of a and b are identical to common divisors of b and
Aa + b
Ba * b
Ca / b
Da - b
Answer & Solution
Correct answer: D. a - b
Euclid subtraction principle establishes that common divisors of a and b are identical to those of a - b and b.
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 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 equalsBy definition, a multiple of any number is the product of that number and