Piyush365
  • 1

Compute gcd(375, 825) using the improved version of Euclid’s algorithm.

  • 1

First, 825 mod 375 = 75, reducing to gcd(375, 75). Next, 375 mod 75 = 0, giving gcd(75, 0). Since the remainder reaches zero, the algorithm terminates to output 75 as the greatest common divisor.

Cbse Class 9 Maths Ganita Manjari Part 2 Solutions
class 9 maths ganita manjari part 2 chapter 11 question answer

Share

1 Answer

  1. Apply the division algorithm starting with the larger number: divide 825 by 375, which leaves a quotient of 2 and remainder 75, reducing the problem to gcd(375, 75). Next, divide 375 by 75, giving a quotient of 5 and remainder 0, reducing to gcd(75, 0). Because the second number is now 0, the algorithm halts and reports gcd(375, 825) = 75.

     

    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/

    • 39
Leave an answer

Leave an answer

Browse