Skip to content
NCERT Exemplar · Q13

Q.There are 1010 lamps in a hall. Each one of them can be switched on independently. Find the number of ways in which the hall can be illuminated.

Kerala DhseShort· 2mImportance★★★★★est
61% · 79/130 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The key idea is that each lamp has 2 independent states (on/off), so for 10 lamps the total number of illumination patterns is 210=10242^{10} = 1024. However, the hall is "illuminated" only when at least one lamp is on, so we exclude the single case where all are off. The answer is 1024−1=10231024 - 1 = 1023.

Why this is a Geometric Progression problem — the intuition

When you have a set of independent switches, each with the same number of choices, the total number of combinations multiplies. That multiplication pattern — 2×2×2×⋯2 \times 2 \times 2 \times \cdots — is exactly a geometric progression. For nn lamps, the number of ways to set them is 2n2^n. But the question asks for the number of ways the hall can be illuminated, which means at least one lamp must be on. So we subtract the one completely dark configuration.

Watch out

A common mistake is to forget that "all lamps off" does not count as illumination. The problem says "illuminated" — that means visible light. Zero lamps on gives no light, so it must be excluded.

Step-by-step solution

  1. Each lamp is independent.

    For a single lamp, there are exactly 2 possibilities: it is either ON or OFF. No other states exist.

  2. Apply the multiplication principle.

    For 2 lamps, the number of combinations is 2×2=42 \times 2 = 4. For 3 lamps, it's 23=82^3 = 8. In general, for nn independent binary switches, the total number of distinct configurations is 2n2^n.

    Total configurations for n lamps=2n\text{Total configurations for } n \text{ lamps} = 2^n

  3. Plug in n=10n = 10. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.