Piyush365
  • 1

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

  • 1

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

Share

1 Answer

  1. Successively take remainders: 1789287 mod 237656 = 125695; 237656 mod 125695 = 111961; 125695 mod 111961 = 13734; 111961 mod 13734 = 2089; 13734 mod 2089 = 1200; 2089 mod 1200 = 889; 1200 mod 889 = 311; 889 mod 311 = 267; 311 mod 267 = 44; 267 mod 44 = 3; 44 mod 3 = 2; 3 mod 2 = 1; and 2 mod 1 = 0. Reaching remainder zero leaves gcd(1, 0) = 1.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

    • 51
Leave an answer

Leave an answer

Browse