NCERT Solutions Ganita Prakash (Part 1) Chapter 2 Puzzle Time! Tremendous in Ten! — In-text Questions

Book page 47 Updated on2026-09-05

Q1.
In Round 1, Roxie wrote 10000000000000 and Estu wrote 999999 × 999999. Between these two, Roxie’s number is greater. Can you see why?
Answer

Compare the two as powers of 10, without multiplying anything out.

Roxie: 10000000000000 = 1 followed by 13 zeros = 1013

Estu: 999999 < 106, so
999999 × 999999 < 106 × 106 = (106)2 = 1012

So Estu's number < 1012 < 1013 = Roxie's number ✓

Estu's number is in fact 9,99,99,80,00,001 ≈ 9.99998 × 1011 — just under a lakh crore, while Roxie's is ten lakh crore.

Why it happens: Estu spent his ten seconds on digits that look impressive but only reach 1012; Roxie spent hers on zeros, and each zero multiplies by 10. Within the rules of Round 1 — no exponents allowed — writing zeros is the fastest way to grow, because each keystroke buys a factor of 10 while a multiplication sign buys nothing on its own.
Q2.
In Round 2, Roxie wrote 10¹⁰⁰⁰ + 10¹⁰⁰⁰ + 10¹⁰⁰⁰ + 10¹⁰⁰⁰ and Estu wrote (10¹⁰⁰⁰⁰⁰⁰) × 9000. Can you say which is greater?
Answer

Estu's number is greater — overwhelmingly so.

Roxie: 101000 + 101000 + 101000 + 101000
= (1 + 1 + 1 + 1) × 101000
= 4 × 101000

Estu: 101000000 × 9000
= 9 × 103 × 101000000
= 9 × 101000003
Ratio = (9 × 101000003) ÷ (4 × 101000)
= 2.25 × 101000003 – 1000
= 2.25 × 10999003 times bigger
Why it happens: adding four copies of a number multiplies it by 4 — it moves the coefficient, and leaves the exponent alone. Estu instead raised the exponent from 1000 to 10,00,000, and the exponent is where all the size lives. This is the chapter's central lesson in one line: when the numbers are large, the exponent decides, and the coefficient is only a detail.
Try This: play a round with the rule "exponents allowed, only addition allowed". Now nobody can multiply, so the winner is whoever writes the biggest single power — and 999 beats 999, since 999 ≈ 3 × 1094 while 999 ≈ 9 × 1017. The exponent wins again.
Was this helpful? Report an error