SolveNCERT
SolveNCERT
HomeSolutionsMathsCh 11Exercise Set 11.3
Class 9 · MathsNCERT 2026 Revised Syllabus

Chapter 11: The World of Algorithms (0904CH11)

Exercise Set 11.3 — 2 questions with step-by-step notebook-style answers.

Exercise Set 11.3(2 questions)

1
How would our original algorithm change if we computed the divisors of n by examining the numbers from 1 to n in reverse order, from n down to 1?

School Level Solution

Initialize an empty list D. For j = n, n−1, …, 1, if n mod j = 0, append j to D. Because the scan is descending, D contains the divisors in decreasing order. The first divisor found is n and the last is 1.
2
What about the last algorithm described above? What happens when we look at common divisors starting from min(m, n) and work backwards to 1?

School Level Solution

Set s=min(m,n). For j=s,s−1,…,1, test whether m mod j=0 and n mod j=0. The first j satisfying both conditions is the greatest common divisor, because every larger candidate has already been checked and rejected. Thus return j immediately; no list of common divisors is needed.

Other Chapters