alleryHow is the least common multiple of a and b computed using their GCD?
A|ab| / gcd(a, b)
B|ab| * gcd(a, b)
C|ab| + gcd(a, b)
D|ab| - gcd(a, b)
Answer & Solution
Correct answer: A. |ab| / gcd(a, b)
The product of the LCM and GCD of two numbers equals the absolute product of the numbers.
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)?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