alleryकौन सी प्रक्रिया दो पूर्णांकों का महत्तम समापवर्तक ज्ञात करती है?
Aआंशिक भिन्न
Bतिर्यक गुणन
Cपरिमेयकरण
Dयूक्लिडियन कलन विधि (Euclidean algorithm)
Answer & Solution
Correct answer: D. यूक्लिडियन कलन विधि (Euclidean algorithm)
यूक्लिडियन कलन विधि (Euclidean algorithm) क्रमिक विभाजन द्वारा महत्तम समापवर्तक ज्ञात करती है।
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