GyaanPe logoGyaanPe Get the free app

Class 9 Maths Chapter 11: The World of Algorithms

NCERT Ganita Manjari · Simple notes, key terms and practice questions

The chapter introduces algorithmic thinking: clear step-by-step procedures to find divisors, the greatest common divisor, and Euclid's subtraction algorithm, linking GCD and LCM.

Key concepts

What is an Algorithm?

An algorithm is a finite, step-by-step set of clear instructions to solve a problem.

Example: A recipe or the steps for long division are algorithms.

In real life: Every app on your phone runs algorithms.

💡 Did you know? The word comes from the name of the mathematician al-Khwarizmi.

Finding Divisors

To list divisors of n, test numbers from 1 up to the square root of n; each divisor found gives a pair.

Example: Divisors of 36: 1×36, 2×18, 3×12, 4×9, 6×6.

In real life: Arranging chairs in equal rows needs divisors.

💡 Did you know? A number with exactly two divisors is prime.

GCD (HCF)

The greatest common divisor is the largest number dividing both numbers.

Example: GCD(12, 18) = 6.

In real life: Cutting two ribbons into equal longest pieces.

💡 Did you know? If GCD is 1, the numbers are coprime, like 17 and 5.

Euclid's Subtraction Algorithm

Replace the larger number by the difference of the two; repeat until both are equal. That number is the GCD.

Example: 48, 18 → 30, 18 → 12, 18 → 12, 6 → 6, 6. GCD = 6.

In real life: Computers use the faster division version.

💡 Did you know? Euclid described this method in his 'Elements' over 2,000 years ago.

GCD and LCM

For two numbers, GCD × LCM = product of the numbers.

Example: 12 × 18 = 216 = 6 × 36, so LCM(12, 18) = 36.

In real life: Bus timetables use LCM to find when buses meet.

💡 Did you know? An algorithm must always stop after a finite number of steps.

Key terms

TermMeaning
AlgorithmFinite step-by-step procedure
DivisorNumber that divides exactly
GCDGreatest common divisor
CoprimeNumbers with GCD 1
LCMLeast common multiple

Quick revision

Practice questions

Q1. An algorithm is

  1. A guess
  2. A type of graph
  3. A number
  4. A finite step-by-step procedure
Show answerD) A finite step-by-step procedure

Q2. GCD(12, 18) is

  1. 2
  2. 36
  3. 6
  4. 3
Show answerC) 6

Q3. Using Euclid's subtraction algorithm, GCD(48, 18) is

  1. 12
  2. 18
  3. 3
  4. 6
Show answerD) 6

Q4. How many divisors does 12 have?

  1. 12
  2. 4
  3. 5
  4. 6
Show answerD) 6

Q5. To find divisors of n, it is enough to test numbers up to

  1. The square root of n
  2. n²
  3. n + 1
  4. 2n
Show answerA) The square root of n

Practise all 10 questions + chapter test

GyaanPe gives Class 9 students short lessons, quizzes and a chapter test for “The World of Algorithms”. Free to start, no ads.

Practise free on GyaanPe Use in browser

All Class 9 Maths chapters