alleryWhich procedure finds the greatest common divisor of two integers?
APartial fractions
BCross multiplication
CRationalisation
DEuclidean algorithm
Answer & Solution
Correct answer: D. Euclidean algorithm
Repeated division with remainders in the Euclidean algorithm yields the greatest common divisor.
Keep practising Fractions
Browse all Fractions questions for RRB NTPC, or explore more Mathematics topics.
Related questions
RRB NTPC · Fraction Concepts and ValuesCompute the sum of fractions: 1/3 + 1/6. Express the result in simplest form:Reduce the fraction 18/24 to its simplest lowest terms:RRB NTPC · Sort Proper and ImproperIrreducible fraction uniqueness is used to prove thatEvery rational number has a unique representation as an irreducible fraction with aIn an irreducible fraction a/b, what is the greatest common divisor of a and b?To reduce 120/90 to lowest terms in a single step, divide both terms by their GCD of