Home/ Questions/Q 550851
Next
In Process
Virat
  • 1
Asked: 2026-10-03T04:38:08+00:00 In:

Assume that m ≥ n. Verify that d divides m and n if and only if d divides both n and m mod n.

  • 1

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 Ganita Manjari Part 2 chapter 11 question answer
Class 9 Ganita Manjari Part 2 chapter 11 The World of Algorithms solutions

cbse class 9 maths ganita manjari part 2 solutionsclass 9 maths ganita manjari part 2 chapter 11 question answerd divides m and n ifganita manjari part 2 chapter 11 the world of algorithms solutionsif d divides both n and m mod nthat m ≥ n
Share

    1 Answer

    1. By the division lemma, write m = qn + r, where r = m mod n.

      1. If d divides both m and n, then m = ad and n = bd. Hence, r = m − qn = (a − qb)d, meaning d divides r.
      2. If d divides both n and r, then n = bd and r = cd. Thus, m = q(bd) + cd = (qb + c)d, meaning d divides m.

       

      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/

      • 0
    Leave an answer

    Leave an answer

    Browse