Identify primes appearing in both factorisation lists. For each shared prime base, select the smaller of its two exponents, multiply these lowest powers together and report that final product as the GCD. Class 9 Ganita Manjari Part 2 chapter 11 question ...
Discussion Forum Latest Questions
Express m = qn + r, where r = m mod n. If d divides m and n, it divides r = m − qn. Conversely, if d divides n and r, it divides m = qn + r. Class 9 ...
1789287 mod 237656 = 125695, reducing to gcd(237656, 125695). Then 237656 mod 125695 = 111961, then remainder 13734, then 2089, then 1200, 889, 311, 267, 44, 3, 2 and finally remainder 1 followed by 0, yielding GCD 1. Cbse Class 9 ...
81000 mod 51000 = 30000, giving gcd(51000, 30000). Then 51000 mod 30000 = 21000, 30000 mod 21000 = 9000, 21000 mod 9000 = 3000 and 9000 mod 3000 = 0. With zero reached, the greatest common divisor is 3000. Ganita Manjari ...
The divisor list would be generated in decreasing order rather than increasing order. Consequently, when determining the greatest common divisor, we must report the leftmost element instead of the rightmost one. Class 9 Ganita Manjari Part 2 chapter 11 question answer