Discussion Forum Latest Questions

Piyush365

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 ...

Piyush365

Start a variable from the larger of the two numbers. Increment it step-by-step by that larger number. When the variable is evenly divisible by the smaller number, stop and report it as the LCM. Cbse Class 9 Maths Ganita Manjari Part ...

Kriti

Aligning right to left ensures identical place values match up in the same column—units with units, tens with tens. Left alignment would mistakenly add mismatched powers of ten, yielding completely wrong sums. Class 9 Ganita Manjari Part 2 chapter 11 The ...