alleryEuclidean algorithm میں جوڑا (a, b) بار بار کس جوڑے سے بدلا جاتا ہے؟
A(a + b, b)
B(b, a / b)
C(axb, b)
D(ب، ایک موڈ ب)
Answer & Solution
Correct answer: D. (ب، ایک موڈ ب)
ہر مرحلہ a کو b سے تقسیم کرنے کے بقیہ میں تبدیل ہوتا ہے جب تک کہ بقیہ 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