Discussion Forum Latest Questions

Virat

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 ...

Piyush365

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 ...