Class 9 · MathsNCERT 2026 Revised Syllabus
Chapter 11: The World of Algorithms (0904CH11)
End-of-Chapter Exercises — 5 questions with step-by-step notebook-style answers.
Jump to:
End-of-Chapter Exercises(5 questions)
1
Compute the following using the improved version of Euclid’s algorithm.(i) gcd(375, 825)(ii) gcd(51000, 81000)(iii) gcd(1789287, 237656)(iv) gcd(2587392, 157656)
School Level Solution
2
Assume that m ≥ n. Verify that d divides m and n if and only if d divides both n and m mod n.
School Level Solution
3
Write an algorithm prime(n) to check if n is prime.(Hint: A prime number p has exactly two distinct factors, 1 and p. Can you make use of divisors(n) to write out prime(n)?)
School Level Solution
4
Write an algorithm primedivisors(n) to compute the list of divisors of n that are prime numbers.(Hint: Compute divisors(n) and then filter out the primes in this list.)
School Level Solution
5
We can also find the gcd of two numbers by computing prime factorisation of both the numbers. Try to write an algorithm to compute the prime factorisation of a number.(i) The prime factorisation of 180 is 2² × 3² × 5¹. How would you represent this?(ii) How would you compare the prime factorisations of two numbers?
School Level Solution