Free Mathematics Class 11 CBSE notes · practise this chapter with an AI quiz

← All study notes

How Many Ways Can Five Friends Sit in a Row? Counting Without Listing

Use the fundamental principle of counting, work with factorial notation, count arrangements of distinct objects with nPr with and without repetition, and count arrangements of letters that repeat.

How can you count possibilities without listing them all?

Listing every arrangement quickly becomes impossible: ten books on a shelf can be arranged in more than three million ways. Counting techniques find such totals in a few lines.

The key ideas are to break a task into stages and multiply, and to use factorials as a compact way of writing long products.

This part covers the fundamental principle of counting, factorials, permutations of distinct objects, and permutations when some objects are alike.

How do you apply the fundamental principle of counting to multi-stage problems?

If one stage can be done in mm ways and, after it, the next can be done in nn ways, the two stages together can be done in m×nm \times n ways; the rule extends to any number of stages.

Worked example 1.
With 33 shirts and 44 trousers, the number of outfits is 3×4=123 \times 4 = 12.

Worked example 2. A 44-digit PIN uses digits 00 to 99 with repetition allowed:

10×10×10×10=1000010 \times 10 \times 10 \times 10 = 10000

Worked example 3. Three-digit numbers with distinct digits chosen from 11 to 99:

9×8×7=5049 \times 8 \times 7 = 504

Worked example 4. Signals are made by hanging 22 of 55 different flags one below the other:

5×4=20 signals5 \times 4 = 20 \text{ signals}

An everyday example. A dosa counter offering 33 types of dosa and 44 chutneys, one of each, gives 3×4=123 \times 4 = 12 possible plates.

The substance. Multiply when choices happen together; add when they are alternatives — going by one of 33 buses or one of 22 trains gives 3+2=53 + 2 = 5 ways.

How do you use factorial notation and simplify expressions with n!?

n!=n×(n−1)×⋯×2×1n! = n \times (n - 1) \times \dots \times 2 \times 1 for a natural number nn, with 0!=10! = 1; ratios of factorials simplify by cancelling the common tail.

5!=1206!=72010!=36288005! = 120 \qquad 6! = 720 \qquad 10! = 3628800

Worked example 1.

7!5!=7×6×5!5!=428!6! 2!=8×72=28\frac{7!}{5!} = \frac{7 \times 6 \times 5!}{5!} = 42 \qquad \frac{8!}{6! \, 2!} = \frac{8 \times 7}{2} = 28

Worked example 2. Find nn if n!(n−2)!=12\dfrac{n!}{(n - 2)!} = 12.

n(n−1)=12n=4n(n - 1) = 12 \qquad n = 4

Worked example 3. Find xx if 16!+17!=x8!\dfrac{1}{6!} + \dfrac{1}{7!} = \dfrac{x}{8!}. Multiply by 8!8!:

8!6!+8!7!=56+8=64x=64\frac{8!}{6!} + \frac{8!}{7!} = 56 + 8 = 64 \qquad x = 64

An everyday example. Arranging 1010 different books on a shelf can be done in 10!=362880010! = 3628800 ways.

The substance. 0!=10! = 1 is defined so that the formulas still work when every object is used, such as n!(n−n)!=n!\frac{n!}{(n - n)!} = n!.

How do you derive and apply nPr = n!/(n - r)! for arrangements, with and without repetition?

Arranging rr of nn distinct objects without repetition fills the first place in nn ways, the next in n−1n - 1, and so on, giving nPr=n(n−1)…(n−r+1)=n!(n−r)!{}^nP_r = n(n - 1)\dots(n - r + 1) = \frac{n!}{(n - r)!}; with repetition allowed, the count is nrn^r.

Worked example 1.
Five friends in a row: 5P5=5!=120{}^5P_5 = 5! = 120. Any 33 of them in a row: 5P3=5!2!=60{}^5P_3 = \frac{5!}{2!} = 60.

Worked example 2. Four-digit numbers from digits 11 to 99 with no repeats:

9P4=9×8×7×6=3024{}^9P_4 = 9 \times 8 \times 7 \times 6 = 3024

Worked example 3 — with repetition. Three-letter strings from 55 letters, repeats allowed: 53=1255^3 = 125.

Worked example 4 — a condition. Three-digit even numbers from 1,2,3,4,6,71, 2, 3, 4, 6, 7, no repetition. The units digit must be 22, 44 or 66:

3×(5×4)=603 \times (5 \times 4) = 60

An everyday example. At a school sports day with 88 runners, gold, silver and bronze can go to them in 8P3=8×7×6=336{}^8P_3 = 8 \times 7 \times 6 = 336 ways.

The substance. Fill the restricted place first — here the units digit — then count the rest.

How do you count arrangements when some objects are alike?

If nn objects include p1p_1 alike of one kind, p2p_2 alike of another, and so on, the number of distinct arrangements is n!p1! p2!…\frac{n!}{p_1! \, p_2! \dots}.

Why.
Swapping identical objects produces no new arrangement, so each distinct arrangement has been counted p1! p2!…p_1! \, p_2! \dots times among the n!n!.

Worked example 1. INDIA has 55 letters with II twice:

5!2!=60\frac{5!}{2!} = 60

Worked example 2. ALLAHABAD has 99 letters: AA four times, LL twice.

9!4! 2!=36288048=7560\frac{9!}{4! \, 2!} = \frac{362880}{48} = 7560

Worked example 3. MISSISSIPPI has 1111 letters: II four, SS four, PP two.

11!4! 4! 2!=34650\frac{11!}{4! \, 4! \, 2!} = 34650

With all four IIs together, treat them as one block: 88 objects with SS four and PP two, giving 8!4! 2!=840\frac{8!}{4! \, 2!} = 840.

An everyday example. Placing 33 identical red diyas and 22 identical white diyas in a row gives 5!3! 2!=10\frac{5!}{3! \, 2!} = 10 different patterns.

The substance. Only identical objects are divided out; distinct letters such as HH, BB and DD contribute 1!1!.
Exam tip

What earns full marks on permutations?

Draw blanks for the places, write the number of choices in each, and state the formula before calculating.

- Stages together: multiply; alternatives: add
- 0!=10! = 1
-
Without repetition
: nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n - r)!}
- With repetition: nrn^r
- Alike objects: divide by the factorial of each repeat count
- Restrictions: fill restricted places first; treat grouped objects as one block

The trap. Forgetting repeated letters. Counting BALLOON as 7!7! overcounts; it is 7!2! 2!=1260\frac{7!}{2! \, 2!} = 1260.
Did you know

How many ways can a pack of 52 cards be shuffled?

Every different order of a pack of cards is a permutation of 5252 distinct objects, so the number of orders is 52!52!.

52!≈8.07×106752! \approx 8.07 \times 10^{67}

That is an 88 followed by 6767 more digits. It is so large that a properly shuffled pack is almost certainly in an order that has never existed before — a striking result from a formula as simple as n!n!.
Exam relevance

How are permutations tested in JEE Main and JEE Advanced?

Permutations and Combinations is a regular chapter for JEE Main and JEE Advanced, and its counting is essential for Probability and the Binomial Theorem.

What gets asked. Arrangements with restrictions — objects together or never together, digits with conditions, circular arrangements counted as (n−1)!(n - 1)!, and the rank of a word among its dictionary arrangements.

Question types. Numerical-value and multiple-choice questions, often with several restrictions combined.

The trap that costs marks. Overcounting when objects repeat, or when a restriction is applied after counting instead of before.
Key takeaways

What must you be able to do from this part?

- Fundamental principle: multiply stages; 33 shirts and 44 trousers give 1212 outfits
- Factorials: 5!=1205! = 120, 0!=10! = 1, 7!5!=42\frac{7!}{5!} = 42
- nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n - r)!}; 5P3=60{}^5P_3 = 60, 9P4=3024{}^9P_4 = 3024
- With repetition: nrn^r
- Alike objects: n!p1! p2!…\frac{n!}{p_1! \, p_2! \dots}; ALLAHABAD gives 75607560
- Restrictions: fill restricted places first; group objects that must stay together

Count the distinct arrangements of the letters of your own first name, then list a few to check the logic.

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Permutations and Combinations — Part 1Create a free account
← Back to all articles