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

Compute gcd(1789287, 237656) using the improved version of Euclid’s algorithm.

  • 0

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 Maths Ganita Manjari Part 2 Solutions
class 9 maths ganita manjari part 2 chapter 11 question answer

237656)cbse class 9 maths ganita manjari part 2 solutionsclass 9 ganita manjari part 2 chapter 11 page 50 question answerganita manjari part 2 chapter 11 the world of algorithms solutionsganita manjari part 2 chapter 11.1 solutionsgcd(1789287using the improved version of euclid's algorithm
Share
    Leave an answer

    Leave an answer

    Browse