Chapter 11 Class 9 - The World of Algorithms (Ganita Manjari)

Learn Chapter 11: The World of Algorithms from NCERT Ganita Manjari, Class 9 Maths, Part II, with Teachoo. Understand how to write clear mathematical procedures, execute them step by step, explain why they work and improve their efficiency.

You already use algorithms when you add numbers column by column or find factors systematically. This chapter takes those familiar methods further: how can you describe every step precisely? What information should you keep track of? How can you find the greatest common divisor (GCD), also called the highest common factor (HCF), without checking every possible divisor?

Teachoo helps you connect familiar arithmetic with these new ideas, making algorithms easier to understand through worked reasoning and clear explanations. Use Teachoo to study the concepts, practise Exercise Sets 11.1–11.3, and approach the End-of-Chapter Exercises with confidence.

What will you learn in Chapter 11?

Addition as an algorithm

Explore how digit-by-digit addition works using place value and carrying. Learn why numbers must be aligned correctly, why every possible case needs an instruction, and why a final carry cannot be ignored.

Finding divisors and the GCD or HCF

Learn to list the divisors of a number, identify the common divisors of two numbers, and select the greatest one. Understand how to turn the definition of GCD into a systematic procedure.

Data structures and keeping track of information

Understand how named quantities and lists help an algorithm store and organise intermediate results. See why the order of a list matters when selecting its largest element.

Improving an algorithm

Explore ways to reduce repeated work, check fewer possible divisors and avoid storing information you no longer need.

Euclid’s subtraction algorithm

Learn why subtracting the smaller number from the larger one preserves their GCD, and how repeated subtraction reduces the original problem to simpler problems.

Āryabhaṭa’s division algorithm

Study the remainder-based method presented in the chapter as Āryabhaṭa’s Division Algorithm. Understand how division replaces many repeated subtractions and leads to a more efficient GCD calculation.

With Teachoo, focus on four questions throughout the chapter: What are the steps? Why are they correct? When do they stop? How much work do they require?

What is an algorithm?

An algorithm is a precisely described, step-by-step procedure for solving a problem.

For example, an algorithm for listing the positive divisors of a positive integer n can:

1. Start with an empty list.

2. Check each integer from 1 to n.

3. Add an integer to the list if it divides n exactly.

4. Report the completed list.

For n = 18, the result is [1, 2, 3, 6, 9, 18].

An algorithm may contain repeated steps and conditional instructions. What matters is that you can follow its instructions consistently and obtain the intended result.

Understand the division algorithm with an example

Find GCD(60, 16) using division and remainders:

60 = 16 × 3 + 12
16 = 12 × 1 + 4
12 = 4 × 3 + 0

The last non-zero remainder is 4, so:

GCD(60, 16) = HCF(60, 16) = 4

The key relationship is:

GCD(m, n) = GCD(n, m mod n), where n > 0

Here, m mod n means the remainder when m is divided by n.

Teachoo helps you understand why this relationship works, so that the calculation becomes a logical sequence rather than a rule to memorise.

Exercise Sets 11.1–11.3 and End-of-Chapter Exercises

Ganita Manjari Class 9 Chapter 11 contains three exercise sets—11.1, 11.2 and 11.3—followed by End-of-Chapter Exercises.

• Exercise Set 11.1: Examine the addition algorithm, test its instructions, and reason about alignment and carrying.

• Exercise Set 11.2: Describe procedures for comparing lists and finding the LCM, and investigate divisor pairs.

• Exercise Set 11.3: Explore how checking numbers in reverse order changes divisor lists and GCD procedures.

• End-of-Chapter Exercises: Calculate GCDs using the improved algorithm, justify the remainder relationship, and design algorithms for checking primes, finding prime divisors and computing prime factorisations.

These questions ask you to explain and design procedures as well as calculate answers. Teachoo helps you build that understanding progressively.

Why study The World of Algorithms with Teachoo?

An algorithm can look correct but still leave an important case unspecified. It can also produce the right answer while doing much more work than necessary.

Teachoo teaches you to examine both correctness and efficiency. You learn to follow instructions precisely, track changing values, identify missing cases and explain improvements.

You do not need prior programming knowledge to begin. Start with the addition methods you already know, then build towards divisor lists and the GCD algorithms. Make Teachoo your go-to learning platform for Ganita Manjari Class 9 Maths, with a clear path from familiar calculations to confident mathematical reasoning.

Frequently asked questions

1. What is Chapter 11 in Class 9 Ganita Manjari?

Chapter 11 in Ganita Manjari, Class 9 Maths, Part II, is “The World of Algorithms.” It introduces algorithms through addition, divisor lists, GCD calculations, data structures and methods for improving efficiency. Teachoo helps you understand each procedure and the reasoning behind it.

2. What is an algorithm in Class 9 Maths?

An algorithm is a systematic, step-by-step procedure for solving a problem. Its instructions should be precise enough to follow without guessing what to do next.

Column addition, listing divisors and calculating the HCF using repeated division are examples of mathematical algorithms.

3. Do I need coding knowledge to study this chapter?

No. The chapter introduces algorithms through mathematical procedures written in words and arithmetic steps. You can execute them by hand.

Teachoo helps you begin with familiar calculations and develop the ability to describe, test and improve a procedure.

4. What does it mean to execute an algorithm?

To execute an algorithm means to follow its instructions step by step, updating the relevant values or lists as you proceed.

For example, while finding the divisors of 18, you check each candidate number and add it to the list only when it divides 18 exactly.

5. Why must an addition algorithm handle a column total of exactly 10?

A column total of exactly 10 requires writing 0 in that column and carrying 1 to the next column.

An instruction that only covers totals “less than 10” and “more than 10” leaves this case unspecified. A complete addition algorithm must cover totals greater than or equal to 10.

6. Are GCD and HCF the same?

Yes. Greatest common divisor (GCD) and highest common factor (HCF) refer to the same number: the largest positive integer that divides both given positive integers exactly.

For example, GCD(18, 24) = HCF(18, 24) = 6.

7. How can you find the GCD using divisor lists?

List the positive divisors of each number, identify the divisors appearing in both lists, and select the largest common divisor.

If the common-divisor list is arranged in increasing order, its last element is the GCD. If the list is not sorted, you must find its largest element explicitly.

8. What is a data structure in this chapter?

A data structure is a way of organising information used by an algorithm. This chapter uses lists to store divisors and common divisors.

Organising information clearly makes it easier to refer to intermediate results and carry out later steps correctly.

9. How does Euclid’s subtraction algorithm work?

For positive integers, repeatedly subtract the smaller number from the larger number. This preserves their GCD.

In the chapter’s formulation, the process eventually reaches a pair containing zero. The remaining non-zero number is the GCD. Teachoo helps you trace the changing pair and understand why the common divisors remain unchanged.

10. What is Āryabhaṭa’s division algorithm in Chapter 11?

The chapter presents a GCD algorithm that uses division remainders instead of repeated subtraction.

Divide the larger number by the smaller number, replace the pair with the smaller number and the remainder, and repeat. When the remainder becomes zero, the last non-zero divisor is the GCD.

The End-of-Chapter Exercises also refer to this as the improved version of Euclid’s algorithm.

11. What does “mod” mean?

m mod n is the remainder when m is divided by n, where n is non-zero.

For example:

17 mod 5 = 2, because 17 = 5 × 3 + 2.

This notation allows the remainder-based GCD algorithm to be written concisely.

12. Why does replacing a number with a remainder preserve the GCD?

If m = qn + r, any common divisor of m and n also divides r = m − qn.

Conversely, any common divisor of n and r also divides m = qn + r.

Therefore, the pairs (m, n) and (n, r) have the same common divisors and the same GCD.

13. Why is division more efficient than repeated subtraction?

One division can replace many subtraction steps.

For example, repeatedly subtracting 2 from 99 takes many steps. Division gives 99 = 2 × 49 + 1 immediately, reducing the GCD problem to GCD(2, 1). One further division completes the calculation.

14. Which exercises are included in Chapter 11?

The chapter includes Exercise Sets 11.1, 11.2 and 11.3, followed by five numbered End-of-Chapter Exercises. The final two end-of-chapter questions are starred and explore prime divisors and prime factorisation.

15. Why choose Teachoo for The World of Algorithms?

Choose Teachoo to understand how algorithms work, why their steps are valid and how they can be improved. Its focus on clear mathematical reasoning makes it a strong choice for studying Ganita Manjari Class 9 Chapter 11, practising GCD and HCF methods, and learning to write your own algorithms confidently.

Learn The World of Algorithms with Teachoo—follow the steps, understand the reasoning and discover better ways to solve problems.