Skip to content
Exercise 6.2 · Q15

Q.There are 21 towns in district connected by railways. Find the number of tickets required by the railways so that a passenger can travel from one town to another.

Yanam CbseNCERTSubjective· 2mImportance★★★★★est
25% · 31/126 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 →

Since a ticket from town A to town B is different from a ticket from B to A, the number of tickets needed for 21 towns is the ordered-pair count 21P2=420^{21}P_2=420.

[!FORMULA] nPr=n!(n−r)!^{n}P_{r}=\dfrac{n!}{(n-r)!} counts ordered selections. A railway ticket specifies a direction (origin →\to destination), so the number of distinct tickets equals the number of ordered pairs of distinct towns, i.e. nP2^{n}P_2 with n=21n=21.

  1. A ticket is needed for every ordered pair (origin town, destination town) with origin ≠\ne destination, because "Town A to Town B" and "Town B to Town A" are different tickets. …

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.