Express m = qn + r, where r = m mod n. If d divides m and n, it divides r = m − qn. Conversely, if d divides n and r, it divides m = qn + r. Class 9 ...
Discussion Forum Latest Questions
2587392 mod 157656 = 64896, reducing to gcd(157656, 64896). Then 157656 mod 64896 = 27864, 64896 mod 27864 = 9168, 27864 mod 9168 = 360, 9168 mod 360 = 168, 360 mod 168 = 24 and 168 mod 24 = ...
The divisor list would be generated in decreasing order rather than increasing order. Consequently, when determining the greatest common divisor, we must report the leftmost element instead of the rightmost one. Class 9 Ganita Manjari Part 2 chapter 11 question answer
Start with an empty result list. For every item in List 1, check whether it appears in List 2. If it is missing from List 2, append that item into your result list and report it. Ganita Manjari part 2 Chapter ...
Omitting Step 5 drops the final carry, making the total wrong whenever the leftmost column sum reaches ten or more. It succeeds for 1200 + 2300 = 3500, but fails for 6000 + 7000, producing 3000 instead of 13000. Ganita Manjari ...