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.
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.
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.
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.
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.
Key terms
| Term | Meaning |
|---|---|
| Algorithm | Finite step-by-step procedure |
| Divisor | Number that divides exactly |
| GCD | Greatest common divisor |
| Coprime | Numbers with GCD 1 |
| LCM | Least common multiple |
Quick revision
- Euclid's algorithm repeatedly subtracts the smaller from the larger.
- GCD × LCM = product of two numbers.
- An algorithm must end in finitely many steps.
Practice questions
Q1. An algorithm is
- A guess
- A type of graph
- A number
- A finite step-by-step procedure
Show answer
D) A finite step-by-step procedureQ2. GCD(12, 18) is
- 2
- 36
- 6
- 3
Show answer
C) 6Q3. Using Euclid's subtraction algorithm, GCD(48, 18) is
- 12
- 18
- 3
- 6
Show answer
D) 6Q4. How many divisors does 12 have?
- 12
- 4
- 5
- 6
Show answer
D) 6Q5. To find divisors of n, it is enough to test numbers up to
- The square root of n
- n²
- n + 1
- 2n
Show answer
A) The square root of nPractise 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