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