NCERT Solutions for Class 8 Maths Chapter 3 A Story of Numbers – step-by-step answers to every exercise and in-text question of the chapter, as per the latest NCERT syllabus for 2027. Read them online or download the free question-answer PDF.
Chapter 3 of Ganita Prakash Part I follows Reema and her father back through four thousand years of counting — sticks and tally marks, the Gumulgal’s twos, Roman letters, Egyptian symbols for powers of 10, the Mesopotamian base-60 tablets, Mayan dots and bars, Chinese rods — to see how four big ideas (grouping, landmark numbers, a base, and place value with 0) finally produced the Hindu number system we write with today.
NCERT Solutions for Class 8 Maths Chapter 3 A Story of Numbers PDF
All the answers are on this page below. The PDF also explains every answer – why it is right and how to check it – so download it for revision.
| Chapter | Download | |
|---|---|---|
| Solutions PDF (English medium) | A Story of Numbers | View PDF |
| Solutions PDF (Hindi medium) | संख्याओं की कहानी | View PDF |
NCERT Solutions for Class 8 Maths Chapter 3 A Story of Numbers – Questions and Answers
All 55 questions of the chapter (textbook pages 48 – 81) are answered below, in the order of the book – in-text questions, activities and the end-of-chapter exercises. Each answer is written the way you would write it in the exam.
In-text Questions — Page 483.1 Reema’s Curiosity
Since the Stone Age — long before writing existed. The oldest evidence is bones with tally marks:
Ishango bone (Democratic Republic of Congo) — notches in columns — 20,000 to 35,000 years old
They counted whatever they had to keep track of, and whatever they had to predict.
- Food: the quantity of grain, fruit and vegetables in store.
- Livestock: the number of animals in the herd, so a missing animal could be spotted.
- Trade: details of goods exchanged with other groups.
- Rituals: the number of offerings given.
- Time: the passing days, so that the new moon, the full moon or the onset of a season could be known and predicted in advance.
About 2000 years ago, in India.
| When | What happened |
|---|---|
| Ancient (Yajurveda Samhita) | Names of numbers built on powers of 10 — eka, dasha, shata, sahasra, āyuta … up to 1012 and beyond, almost as we say them today |
| c. 3rd century CE | Bakhshali manuscript — the first known writing of numbers with ten digits including 0, then notated as a dot |
| c. 499 CE | Aryabhata first fully explains the ten-symbol Indian system and computes with it |
| c. 628 CE | Brahmagupta codifies 0 as a number, with negative numbers |
| c. 800 – 830 CE | Transmitted to the Arab world; Al-Khwārizmī and Al-Kindi popularise it |
| c. 1100 – 1200 CE | Reaches Europe; Fibonacci argues for adopting it |
| By the 17th century | Adopted throughout Europe — not adopting it would have blocked scientific progress |
The Mesopotamian system is base 60. It has just two marks: a wedge for 1 (we write Y) and a corner wedge for 10 (we write <). Numbers up to 59 sit in a single position; from 60 onwards a second position to the left is used.
50 = 10 + 10 + 10 + 10 + 10 → <<<<<
100 = (1) × 60 + 40 → Y | <<<<
So 20 and 50 need only the ones position. But 100 is bigger than 60, so it needs two positions: one 60, and 40 left over.
Math Talk — Page 51The Mechanism of Counting
Keep one stick for every cow, and match the sticks against the cows as they come back.
- In the morning, as each cow leaves, drop one stick into a pot. Nothing is counted and nothing is named — one cow, one stick.
- In the evening, as each cow returns, take one stick out of the pot.
- If the pot is empty when the last cow is in, every cow is back. If sticks are left over, that leftover collection is the number of missing cows.
Pair off the sticks — no counting is needed.
- Make our pile of sticks — one per cow. Let the neighbour make his.
- Now pair the piles off: take one stick from ours and one from his, again and again.
- Whichever pile runs out first belongs to the person with fewer cows. If both run out together, the herds are equal.
The sticks left over in the neighbour’s pile after the pairing are the answer.
ours run out first
the sticks still lying in his pile = the number of extra cows we need
Carry that leftover collection of sticks to the market, and buy one cow for each stick. Now the two herds can be matched exactly.
In-text Questions — Page 52 – 53The Mechanism of Counting — Methods 1 to 3
By pairing one collection against the other and looking at what is left.
| Step | What you do with the sticks | What it tells you |
|---|---|---|
| 1 | One stick for each of our cows; one stick for each of the neighbour’s cows | Two collections that stand for the two herds |
| 2 | Remove one stick from each pile at the same time, again and again | A one-to-one pairing is being built |
| 3 | Our pile empties first | We have fewer cows (Q2) |
| 4 | Count nothing — just keep the sticks still lying in his pile | That collection is how many more cows we need (Q3) |
Exactly as many as your language has letters — no more.
Devanagari (Hindi): 11 vowels + 33 consonants = 44 letters → numbers 1 to 44
Tamil: 12 vowels + 18 consonants = 30 basic letters → numbers 1 to 30
Whichever language you take, the answer is a fixed, finite number. Count the letters of your own alphabet and that is your limit.
Yes — the way the Roman system itself did it. Keep repeating the symbols, and bring in a fresh symbol whenever the repetition gets too long.
Instead of writing XXXXX for 50, give it a new symbol: L
Then LX, LXX, LXXX, XC … and again a new symbol for 100: C
and further: D = 500, M = 1000
So the extension works in two moves: (a) repeat the symbol you already have, and (b) when about five repetitions have piled up, replace that whole group by a brand-new symbol.
Figure it Out — Page 54The Mechanism of Counting
Every one of the four operations can be done by moving sticks about. Call the two collections A and B.
| Operation | What to do with the sticks | What the answer is |
|---|---|---|
| A + B | Push the two heaps together into one heap. | The combined heap |
| A − B | Pair each stick of B with a stick of A and take both away. Stop when B is exhausted. | The sticks of A still unpaired |
| A × B | For every single stick of B, lay out one fresh copy of the whole heap A. Then pool all those copies together. | The pooled heap |
| A ÷ B | From A, keep pulling out bunches, each bunch matched one-to-one with B. Beside each completed bunch place one marker stick. | The markers are the quotient; the sticks left in A that cannot fill a bunch are the remainder |
Use all the strings of a given length before moving to the next length, in dictionary order.
| Length of string | Strings | Numbers covered | How many |
|---|---|---|---|
| 1 letter | a, b, c, …, z | 1 – 26 | 26 |
| 2 letters | aa, ab, ac, …, az, ba, …, zz | 27 – 702 | 262 = 676 |
| 3 letters | aaa, aab, …, zzz | 703 – 18278 | 263 = 17576 |
| 4 letters | aaaa, …, zzzz | 18279 – 475254 | 264 = 456976 |
The first two-letter string is aa, and it lands on 27 — exactly as the book suggests.
(your own system may look quite different): choose three symbols, each standing for a group ten times the one before.
| Number | Grouped as | My numeral |
|---|---|---|
| 7 | 1+1+1+1+1+1+1 | ●●●●●●● |
| 23 | 10 + 10 + 1 + 1 + 1 | ■■●●● |
| 140 | 100 + 10 + 10 + 10 + 10 | ★■■■■ |
| 306 | 100 + 100 + 100 + 1+1+1+1+1+1 | ★★★●●●●●● |
In-text Questions — Page 57 – 583.2 III. Number Names Obtained by Counting in Twos
(Picture on page 57 — nine boxes in three rows: two hens, a bunch of yellow flowers, nesting dolls; a staircase, a dog, a bunch of grapes; apples, pencils, the pyramids.)
Counting the nine boxes on page 57, row by row:
| Box | Objects | Could you see it at a glance? |
|---|---|---|
| Hens | 2 | Yes, instantly |
| Bunch of yellow flowers | too many to say | No — you would have to pull the bunch apart |
| Nesting dolls | 4 | Yes, just about |
| Steps of the staircase | about 15 | No — you have to run your eye up them |
| Dog | 1 | Yes, instantly |
| Bunch of grapes | too many to say | No |
| Apples | 5 | Only just — most people need a quick count |
| Pencils | 9 | No — you count them one by one |
| Pyramids | 3 | Yes, instantly |
Up to about 4. Most humans find it difficult to take in a group of 5 or more objects in a single glance.
The difficulty is that the numeral stays almost as long as the number itself.
So 1345 = 5 + 5 + 5 + … + 5 (269 times)
You would have to write the “five” symbol 269 times. Grouping by 5 shortens the tally from 1345 marks to 269, but that is still far too long to write, read or compare easily.
Figure it Out — Page 593.2 IV. The Roman Numerals
Group each number into landmark numbers, largest first. For 4s and 9s use the “one less” form (IV, IX, XL, XC, CM).
= MCCXXII
= MM + CM + XC + IX = MMCMXCIX
= CCCII
= DCCXV
In-text Questions — Page 603.2 IV. The Roman Numerals
Pool the symbols of both numerals, then regroup from the smallest upwards — remembering that the Roman exchange rates are not all the same.
LXXVIII = L + X + X + V + I + I + I
Pool: L L X X X X X V V I I I I I
Now exchange, one landmark at a time:
| Exchange | Because | Left with |
|---|---|---|
| I I I I I → V | 5 ones make a five | L L, X X X X X, V V V |
| V V → X | 2 fives make a ten | L L, X X X X X X, V |
| X X X X X → L | 5 tens make a fifty | L L L, X, V |
| L L → C | 2 fifties make a hundred | C, L, X, V |
Check: 87 + 78 = 165 = 100 + 50 + 10 + 5 ✓
There is no general shortcut, because the Roman landmark numbers are not the powers of any one number. Each product has to be worked out separately by repeated addition or by the distributive law.
| Product | Working | Roman numeral |
|---|---|---|
| V × L | 5 fifties = L+L+L+L+L = 250 = C+C+L | CCL |
| L × D | 50 five-hundreds = 25,000 = 25 thousands | MMMMMMMMMMMMMMMMMMMMMMMMM (M written 25 times) |
| V × D | 5 five-hundreds = 2500 = M + M + D | MMD |
| VII × IX | VII × (X − I) = LXX − VII = 70 − 7 = 63 = L + X + III | LXIII |
(Cartoon on page 60: a “Daredevil Contest” with two doors — door I says “Multiply CCXXXI and MDCCCLII”, door II says “Fight with a lion”. Nearly everyone is queuing at door II.)
First read the two numerals.
MDCCCLII = 1000 + 500 + 300 + 50 + 2 = 1852
Break the second numeral into its landmark parts and use the distributive law:
= 231 × 1000 + 231 × 800 + 231 × 50 + 231 × 2
= 231000 + 184800 + 11550 + 462
= 427812
Product = 427812. Written in Roman numerals it needs 427 M’s followed by DCCCXII.
Figure it Out — Page 60 – 613.2 IV. The Roman Numerals
Because in such languages the number word is still tied to the thing being counted — the count has not yet been separated from what is counted.
- The number word carries the object with it. One series for fish, another for coconuts or canoes tells the listener both how many and of what.
- Different goods come in different natural groups — pairs, bunches, baskets — so each series suits the way that good is stacked and traded.
- Some series were kept for special things, such as people or objects used in rituals.
urapon = 1, ukasar = 2. A number is a string: one ukasar for each 2 in it, then one urapon if it is odd.
- Add: join the two strings; two urapon make one ukasar.
- Subtract: strike off ukasar against ukasar and urapon against urapon (split an ukasar into two urapon if needed).
- Multiply: write the first string as many times as the second number says; then turn each pair of urapon into an ukasar.
- Divide: cut the string into equal bunches, each matching the divisor; the number of bunches is the answer.
| Part | In 2s and 1s | Working | Answer |
|---|---|---|---|
| (i) | (2+2+2+2+1) + (2+2+2+1) = 9 + 7 | 7 ukasar and 2 urapon; the two urapon make one more ukasar → 8 ukasar | ukasar-ukasar-ukasar-ukasar-ukasar-ukasar-ukasar-ukasar (16) |
| (ii) | (2+2+2+2+1) − (2+2+2) = 9 − 6 | Cancel three ukasar; one ukasar and one urapon remain | ukasar-urapon (3) |
| (iii) | (2+2+2+2+1) × (2+2) = 9 × 4 | Write the 9-string four times: 16 ukasar and 4 urapon; the four urapon make 2 more ukasar → 18 ukasar | ukasar repeated 18 times (36) |
| (iv) | (8 ukasar) ÷ (2 ukasar) = 16 ÷ 4 | Break the 8 ukasar into bunches of 2 ukasar: 4 bunches | ukasar-ukasar (4) |
Five features, and each of them fixes a specific Roman weakness.
| Feature | Hindu number system | Roman number system |
|---|---|---|
| Value of a symbol | Place value — the 3 in 375 means 3 × 102, the 3 in 32 means 3 × 10 | Fixed value — X is 10 wherever it stands |
| A symbol for nothing | 0, used as a digit and as a number | No symbol for zero at all |
| How many symbols | Ten symbols write every number, however large | A new symbol needed for each new landmark: I V X L C D M … |
| Landmark numbers | All powers of 10, so landmark × landmark is again a landmark | Ratios jump ×5, ×2, ×5, ×2 — no pattern, so no multiplication rule |
| Length of a numeral | Grows very slowly — 1888 needs 4 digits | Grows fast — 1888 = MDCCCLXXXVIII, 13 symbols |
Sample answer. Take the system from page 54 (● = 1, ■ = 10, ★ = 100) and refine it with the ideas of this section.
Refinement 1 — make the landmark numbers powers of one number. Ours already are: 1, 10, 100. So extend the same way instead of inventing unrelated jumps: the next landmarks must be 1000, 10000, 100000, and so on.
Refinement 2 — test it.
| Test | Before | After refining |
|---|---|---|
| Is the sequence unending? | No — stops below 1000 | Yes, once every power of 10 has its own symbol |
| Is regrouping simple? | Yes — ten ● make one ■ | Yes, and now the same rule holds at every level |
| Is a landmark × a landmark a landmark? | Yes — ■ × ■ = ★ | Yes, so multiplication has a rule |
| Does a symbol ever repeat 10 times? | No — ten of any symbol become one of the next | No — so at most 9 of each |
One problem remains: every new power of 10 still needs a new symbol. Section 3.4 removes it by letting the position of a symbol show its landmark.
Figure it Out — Page 623.3 I. The Egyptian Number System
The Egyptian symbols stand for the powers of 10:
Group each number into powers of 10 and draw that many of each symbol.
| Number | Grouped as | Symbols needed |
|---|---|---|
| 10458 | 10000 + 400 + 50 + 8 | 1 finger, 4 coils, 5 arches, 8 strokes |
| 1023 | 1000 + 20 + 3 | 1 lotus, 2 arches, 3 strokes |
| 2660 | 2000 + 600 + 60 | 2 lotus, 6 coils, 6 arches |
| 784 | 700 + 80 + 4 | 7 coils, 8 arches, 4 strokes |
| 1111 | 1000 + 100 + 10 + 1 | 1 lotus, 1 coil, 1 arch, 1 stroke |
| 70707 | 70000 + 700 + 7 | 7 fingers, 7 coils, 7 strokes |
Count each kind of symbol and multiply by its landmark value.
| Symbols shown | Value | Number | |
|---|---|---|---|
| (i) | 2 coils, 7 arches, 6 strokes | 2 × 100 + 7 × 10 + 6 × 1 = 200 + 70 + 6 | 276 |
| (ii) | 4 lotus, 3 coils, 2 arches, 2 strokes | 4 × 1000 + 3 × 100 + 2 × 10 + 2 × 1 = 4000 + 300 + 20 + 2 | 4322 |
In-text Questions — Page 623.3 II. Variations on the Egyptian System and the Notion of Base
Yes. Grouping 5 collections of the previous landmark each time gives landmarks that are the powers of 5 — a base-5 system:
Yes, by any positive integer n greater than 1: the landmarks are then 1, n, n2, n3, … (a base-n system; the Egyptian one has n = 10). With n = 1 every landmark is 1, so nothing new forms.
In-text Questions — Page 633.3 II. Variations on the Egyptian System and the Notion of Base
Start from the largest landmark number that is smaller than 143. That is 53 = 125, since the next one, 625, is too big.
18 = 5 + 5 + 5 + 3 (three 5s, then 3 ones)
So 143 = 125 + 5 + 5 + 5 + 1 + 1 + 1
Check: 125 + 15 + 3 = 143 ✓
Figure it Out — Page 633.3 II. Variations on the Egyptian System and the Notion of Base
The symbols are △ = 1, □ = 5, ⬡ = 25, ○ = 125, ∿ = 625, ↑ = 3125. Each time, take as many of the largest possible landmark as you can, then move down.
| Number | Grouping | Numeral | Base-5 digits |
|---|---|---|---|
| 15 | 5 + 5 + 5 | □□□ | 30 |
| 50 | 25 + 25 | ⬡⬡ | 200 |
| 137 | 125 + 5 + 5 + 1 + 1 | ○ □□ △△ | 1022 |
| 293 | 125 + 125 + 25 + 5 + 5 + 5 + 1 + 1 + 1 | ○○ ⬡ □□□ △△△ | 2133 |
| 651 | 625 + 25 + 1 | ∿ ⬡ △ | 10101 |
Yes — zero. There is no symbol for it, and there is no way to build it, because a numeral here is a collection of symbols and zero would have to be an empty collection, which cannot be seen on the page.
Every counting number 1, 2, 3, … can be written: take the largest landmark that fits, subtract, and repeat until nothing is left.
Start at 1 and multiply by 7 each time.
71 = 7
72 = 49
73 = 343
74 = 2401
75 = 16807 …
So the landmark numbers of a base-7 system are 1, 7, 49, 343, 2401, 16807, …
In general, the landmark numbers of a base-n system are the powers of n:
Figure it Out — Page 653.3 Advantages of a Base-n System
(i) Read the two numerals first.
Second: 5 coils, 7 strokes = 500 + 7 = 507
| Symbol | Total | Regrouping | Kept |
|---|---|---|---|
| strokes (1) | 8 + 7 = 15 | 10 strokes → 1 arch | 5 strokes, carry 1 arch |
| arches (10) | 0 + 0 + 1 = 1 | — | 1 arch |
| coils (100) | 6 + 5 = 11 | 10 coils → 1 lotus | 1 coil, carry 1 lotus |
| lotus (1000) | 9 + 1 = 10 | 10 lotus → 1 finger | 0 lotus, carry 1 finger |
| finger (10000) | 1 | — | 1 finger |
= 1 finger + 1 coil + 1 arch + 5 strokes = 10000 + 100 + 10 + 5 = 10115
Check: 9608 + 507 = 10115 ✓
(ii)
Second: 4 arches, 6 strokes = 40 + 6 = 46
arches: 8 + 4 = 12 → 1 coil and 2 arches
coils: 0 + 1 (carried) = 1
lotus: 1
Sum =
= 1 lotus + 1 coil + 2 arches + 6 strokes = 1000 + 100 + 20 + 6 = 1126
Check: 1080 + 46 = 1126 ✓
Read the two numerals:
○○○ ⬡ □□ △△ = 375 + 25 + 5 + 5 + 1 + 1 = 412
Now pool them, symbol by symbol:
| Symbol | Value | First + Second | Total | Regroup? |
|---|---|---|---|---|
| △ | 1 | 2 + 2 | 4 | No, 4 < 5 |
| □ | 5 | 1 + 2 | 3 | No |
| ⬡ | 25 | 2 + 1 | 3 | No |
| ○ | 125 | 1 + 3 | 4 | No |
= 4 × 125 + 3 × 25 + 3 × 5 + 4 × 1
= 500 + 75 + 15 + 4 = 594
Check: 182 + 412 = 594 ✓
In-text Questions — Page 663.3 Advantages of a Base-n System
Split each numeral into the landmark numbers it is made of, multiply every landmark of the first by every landmark of the second, then pool the results and regroup.
This works because the product of two landmark numbers is again a landmark number (10a × 10b = 10a+b), so each small product is a single symbol.
Multiplying a landmark by 10 gives the next landmark, because it raises the power of 10 by one.
| Product | In powers of 10 | Answer | |
|---|---|---|---|
| (i) | ∩ × ∩ | 10 × 10 = 102 | coil = 100 |
| (ii) | coil × ∩ | 102 × 10 = 103 | lotus = 1000 |
| (iii) | lotus × ∩ | 103 × 10 = 104 | finger = 10,000 |
| (iv) | finger × ∩ | 104 × 10 = 105 | tadpole = 1,00,000 |
Multiplying by 102 moves a landmark up by two steps.
| Product | In powers of 10 | Answer | |
|---|---|---|---|
| (i) | ∩ × coil | 10 × 102 = 103 | lotus = 1000 |
| (ii) | coil × coil | 102 × 102 = 104 | finger = 10,000 |
| (iii) | lotus × coil | 103 × 102 = 105 | tadpole = 1,00,000 |
| (iv) | finger × coil | 104 × 102 = 106 | kneeling man = 10,00,000 |
In-text Questions — Page 673.3 Advantages of a Base-n System
Add the powers of 10 each time.
| Product | In powers of 10 | Answer | |
|---|---|---|---|
| (i) | ∩ × tadpole | 10 × 105 = 106 | kneeling man = 10,00,000 |
| (ii) | coil × lotus | 102 × 103 = 105 | tadpole = 1,00,000 |
| (iii) | lotus × lotus | 103 × 103 = 106 | kneeling man = 10,00,000 |
| (iv) | finger × kneeling man | 104 × 106 = 1010 | 1010 — no Egyptian symbol (the list stops at 107) |
Thus the product of any two landmark numbers is another landmark number.
Yes in the base-5 system, and yes in every base-n system.
○ × □ = 125 × 5 = 625 = ∿ (53 × 51 = 54)
⬡ × ⬡ = 25 × 25 = 625 = ∿ (52 × 52 = 54)
Every symbol in the numeral is replaced by the next symbol up, and the number of each kind stays the same.
coil ∩∩ | is the same as coil + ∩∩ + |, so
(coil + ∩∩ + |) × ∩ = (coil × ∩) + (∩∩ × ∩) + (| × ∩)
= lotus + coil coil + ∩
= lotus coil coil ∩
In numbers: 121 × 10 = 1210 ✓
In-text Questions — Page 683.3 Advantages of a Base-n System
(i) The numeral in the bracket has 5 coils, 2 arches and 2 strokes: 500 + 20 + 2 = 522. Multiplying by ∩ (10), each symbol steps up to the next one:
| Was | Becomes | Value |
|---|---|---|
| 5 coils (500) | 5 lotus | 5000 |
| 2 arches (20) | 2 coils | 200 |
| 2 strokes (2) | 2 arches | 20 |
(ii) lotus ∩ = 1000 + 10 = 1010
∩ → coil (10 → 100)
Product = = 1 finger, 1 coil = 10000 + 100 = 10100 ✓
Replace every symbol by the next symbol in the list, keeping the count of each symbol exactly as it was.
In Hindu numerals the very same rule reads: write a 0 at the end.
↓ each symbol steps up
4 lotus + 3 coils + 7 arches = 4370 = 437 × 10 ✓
In-text Questions — Page 693.3 Abacus that Makes Use of the Decimal System
Slide the counters from the right of the vertical partition across onto the matching lines on the left, then tidy up each line.
On the board, 2907 is on the left and 43 on the right:
| Line | 2907 has | 43 has | After bringing together | Value |
|---|---|---|---|---|
| 1000 | 2 counters on the line | — | 2 on the line | 2000 |
| 100 | 1 above (500) + 4 on the line (400) | — | 1 above + 4 on the line | 900 |
| 10 | — | 4 counters | 4 + 1 carried = 5 → replaced by 1 counter above the line | 50 |
| 1 | 1 above (5) + 2 on the line (2) | 3 counters | 7 + 3 = 10 → cleared, 1 counter added to the 10s line | 0 |
Check: 2907 + 43 = 2950 ✓
Two exchanges keep the board readable:
- Ten counters on a line are taken off and replaced by one counter on the next line up — the next power of 10.
- Five counters on a line are taken off and replaced by one counter just above that line, since a counter above a line stands for 5.
→ clear the 1s line, put 1 counter on the 10s line
10s line: 4 + 1 = 5 counters → replaced by 1 counter above the 10s line (= 50)
Figure it Out — Page 69 – 703.3 III. Shortcomings of the Egyptian System
No — not in the tidied-up form that the Egyptians actually wrote.
and 10a+1 has a symbol of its very own.
So ten identical symbols would always be swapped for one symbol of the next kind. Each symbol can therefore appear at most 9 times.
(The one exception is the largest symbol, the sun, 107. There is no symbol for 108, so numbers of ten crore or more would need the sun 10 or more times — the shortcoming described on page 69.)
Sample answer. Take three symbols for the first three landmarks of base 4:
| Number | Grouping | Numeral | Base-4 digits |
|---|---|---|---|
| 1 | 1 | ∟ | 1 |
| 2 | 1 + 1 | ∟∟ | 2 |
| 3 | 1 + 1 + 1 | ∟∟∟ | 3 |
| 4 | 4 | △ | 10 |
| 5 | 4 + 1 | △∟ | 11 |
| 6 | 4 + 2 | △∟∟ | 12 |
| 7 | 4 + 3 | △∟∟∟ | 13 |
| 8 | 4 + 4 | △△ | 20 |
| 9 | 8 + 1 | △△∟ | 21 |
| 10 | 8 + 2 | △△∟∟ | 22 |
| 11 | 8 + 3 | △△∟∟∟ | 23 |
| 12 | 4 + 4 + 4 | △△△ | 30 |
| 13 | 12 + 1 | △△△∟ | 31 |
| 14 | 12 + 2 | △△△∟∟ | 32 |
| 15 | 12 + 3 | △△△∟∟∟ | 33 |
| 16 | 16 | □ | 100 |
Replace every symbol by the next symbol up, keeping the counts unchanged.
(1 → 5 → 25 → 125 → 625 → 3125)
Worked example. Take ○ □□ △ = 125 + 5 + 5 + 1 = 136.
Result: ∿ ⬡⬡ □ = 625 + 25 + 25 + 5 = 680
Check: 136 × 5 = 680 ✓
In-text Questions — Page 723.4 I. The Mesopotamian Number System
Can we represent this more compactly?
Yes. Since 640 = (10) × 60 + 40, write the numeral for ten, then the 60-symbol just once, then the numeral for forty:
It is read as “ten 60s and one 40”, exactly as the equation says.
Figure it Out — Page 733.4 I. The Mesopotamian Number System
Write Y for the 1-wedge and < for the 10-wedge. Reading right to left, the slots stand for 1s, 60s, 3600s.
| Grouped as | 3600s | 60s | 1s | |
|---|---|---|---|---|
| (i) 63 | 1 × 60 + 3 | — | Y | YYY |
| (ii) 132 | 2 × 60 + 12 | — | YY | < YY |
| (iii) 200 | 3 × 60 + 20 | — | YYY | << |
| (iv) 60 | 1 × 60 + 0 | — | Y | (blank) |
| (v) 3605 | 1 × 3600 + 0 × 60 + 5 | Y | (blank) | YYYYY |
Checks: 60 + 3 = 63 ✓ 120 + 12 = 132 ✓ 180 + 20 = 200 ✓ 3600 + 0 + 5 = 3605 ✓
In-text Questions — Page 733.4 I. The Mesopotamian Number System
A single wedge Y again — this time standing in the 3600s slot, with two empty slots to its right.
| Number | 3600s | 60s | 1s | What is actually written |
|---|---|---|---|---|
| 1 | — | — | Y | Y |
| 60 | — | Y | (blank) | Y |
| 3600 | Y | (blank) | (blank) | Y |
All three look the same on the tablet. Only the context could tell a reader which was meant.
In-text Questions — Page 763.4 II. The Mayan Number System
Landmarks: 1, 20, 360 (not 400). A dot is 1, a bar is 5, a shell is 0. The lowest set counts 1s, the set above counts 20s, the next counts 360s.
| Grouped as | 360s row | 20s row | 1s row | |
|---|---|---|---|---|
| (i) 77 | 3 × 20 + 17 | — | 3 dots | 3 bars + 2 dots |
| (ii) 100 | 5 × 20 + 0 | — | 1 bar | shell |
| (iii) 361 | 1 × 360 + 0 × 20 + 1 | 1 dot | shell | 1 dot |
| (iv) 721 | 2 × 360 + 0 × 20 + 1 | 2 dots | shell | 1 dot |
In-text Questions — Page 783.4 IV. The Hindu Number System
Where it figures: right at the end of the story — it is the one system that carries every idea in the chapter at once, and adds the last one of its own.
| Idea | First seen in | Present in the Hindu system? |
|---|---|---|
| Counting in a fixed group size | Gumulgal (2s) | Yes — groups of 10 |
| A sequence of landmark numbers | Roman | Yes |
| Landmarks that are powers of one number — a base | Egyptian (base 10) | Yes — base 10, decimal |
| Position instead of a landmark symbol | Mesopotamian, Mayan, Chinese | Yes — place value |
| 0 as a placeholder and as a number | Indian mathematics | Yes — and only here |
Its landmark numbers are the powers of 10:
Yes, it is a place value system. The book’s own example:
= 300 + 70 + 5 = 375 ✓
Figure it Out — Page 803.4 The Hindu Number System
Why they alternated: because the rod numerals were actual sticks laid out on a counting board, and a blank space between two places is invisible. Turning the rods through a right angle at every place makes the boundary between places visible instead.
- Zong (upright rods) — units, hundreds, ten-thousands …
- Heng (flat rods) — tens, thousands, hundred-thousands …
41 with Zong only: 41 = 4 tens and 1 one, so you would put down Zong-4 followed by Zong-1:
Yes, it can be read in many other ways if the gaps are not clear. Five rods can be split up as:
| How the rods are split | Reads as |
|---|---|
| | | | | | (no split) | 5 |
| | | | | | | 14 |
| | | | | | | 23 |
| | | | | | | 32 |
| | | | | | | 41 |
| | | | | | | 122 |
| | | | | | | 113 |
| | | | | | | 212 |
| | | | | | | 311 |
A base-2 system needs exactly two digits, one of which must stand for zero. Let
landmark numbers: 1, 2, 4, 8, 16, 32, …
| Number | Grouped into powers of 2 | Base-2 place value system | Gumulgal system |
|---|---|---|---|
| 1 | 1 | ukasar | urapon |
| 2 | 2 | ukasar urapon | ukasar |
| 3 | 2 + 1 | ukasar ukasar | ukasar-urapon |
| 4 | 4 | ukasar urapon urapon | ukasar-ukasar |
| 5 | 4 + 1 | ukasar urapon ukasar | ukasar-ukasar-urapon |
| 6 | 4 + 2 | ukasar ukasar urapon | ukasar-ukasar-ukasar |
| 7 | 4 + 2 + 1 | ukasar ukasar ukasar | ukasar-ukasar-ukasar-urapon |
| 8 | 8 | ukasar urapon urapon urapon | ukasar-ukasar-ukasar-ukasar |
- Gumulgal: position means nothing — each ukasar adds 2 and each urapon adds 1; there are only two landmarks (1, 2) and no zero.
- Base-2 place value: position is everything — ukasar means 1, 2, 4 or 8 depending on its place; the landmarks go on for ever (1, 2, 4, 8, 16, …) and urapon works as 0.
- So numerals are much shorter: 16 needs 8 words in the Gumulgal system but only 5 digits in base 2.
Sample answer.
- Daily life: prices and bills, dates, clock time, phone numbers and PIN codes, marks, cricket scores, page numbers.
- Professions: shopkeepers and accountants, bankers, engineers and surveyors, doctors and chemists, scientists, and computer programmers (computers work with only 0 and 1).
- Without them: every sum would need an abacus and a trained person; there would be no column addition or long division on paper, no decimals, and so no modern science, computers or digital payments.
With 8 fingers we would almost certainly have settled on base 8. Everything else about the system would be unchanged — only the base would differ.
Base 5: digits 0 to 4; places worth 1, 5, 25, 125, …
Writing 25:
| Base | Grouping | Numeral |
|---|---|---|
| 8 | 25 = 3 × 8 + 1 | 31 |
| 5 | 25 = 1 × 25 + 0 × 5 + 0 × 1 | 100 |
| 2 | 25 = 16 + 8 + 1 = 1×16 + 1×8 + 0×4 + 0×2 + 1×1 | 11001 |
| 10 | 25 = 2 × 10 + 5 | 25 |
Checks: 3 × 8 + 1 = 25 ✓ 1 × 25 = 25 ✓ 16 + 8 + 0 + 0 + 1 = 25 ✓
Chapter 3 of 13 – Maths
- Previous: Chapter 2 Power Play
- Next: Chapter 4 Quadrilaterals
- All chapters: NCERT Solutions Class 8 Maths
Also for This Chapter
NCERT Solutions Class 8 Maths Chapter 3 A Story of Numbers – Overview
| Class | Class 8 |
| Subject | Maths |
| Chapter | 3 – A Story of Numbers |
| Textbook pages | 48 – 81 |
| Questions solved | 55 |
| Session | 2027 |
| Format | Full answers on this page + PDF |
NCERT Solutions Class 8 Maths Chapter 3 – FAQs
Where can I download NCERT Solutions Class 8 Maths Chapter 3 A Story of Numbers PDF?
Read every answer on this page, or download the free PDF from the table at the top.
Is this for the 2027 session?
Yes, it follows the latest NCERT Class 8 Maths book for 2027.
How many questions are solved in NCERT Class 8 Maths Chapter 3?
All 55 questions of the chapter (textbook pages 48 – 81) – the in-text questions, activities and the end-of-chapter exercises.
How should I use these solutions?
Read the chapter in the NCERT book first, attempt the questions yourself, then check your answers here.