Home/ Questions/Q 550627
Next
Piyush365
  • 0
Asked: 2026-10-01T04:57:39+00:00 In:

Compute gcd(51000, 81000) using the improved version of Euclid’s algorithm.

  • 0

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 part 2 Chapter 11 Solutions
Class 9 Ganita Manjari Part 2 Chapter 11 Page 50 Question Answer

81000)ganita manjari part 2 chapter 11 question answerganita manjari part 2 chapter 11 the world of algorithms solutionsgcd(51000mproved version of euclid'sthe world of algorithms solutions
Share
    Leave an answer

    Leave an answer

    Browse