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

← All study notes

Why Choosing a Team Is Easier to Count Than Arranging One

Derive the nCr formula with its identities and Pascal's rule, count selections from different items and from identical items, and solve mixed problems that first select and then arrange.

What is the difference between arranging and choosing?

Picking 3 students for a quiz team is different from giving them the posts of captain, deputy and reserve. In the first case order does not matter — that is a combination. Combinations count selections, and they appear in probability, the binomial theorem and everyday choices.

This lesson covers the nCr formula and its identities, selections from different items, selections from items that are not all different, and mixed problems.

How is the nCr formula derived, and why does nCr equal nC(n-r)?

Each selection of r objects from n can be arranged in r!r! ways, so nPr=nCr×r!^nP_r = {}^nC_r \times r! and nCr=n!r! (n−r)!^nC_r = \dfrac{n!}{r!\,(n - r)!}; choosing r objects is the same as rejecting the other n−rn - r, so nCr=nCn−r^nC_r = {}^nC_{n - r}, and Pascal's rule states nCr+nCr−1=n+1Cr^nC_r + {}^nC_{r - 1} = {}^{n + 1}C_r.

Identities:


- nC0=nCn=1^nC_0 = {}^nC_n = 1
- nCr=nCn−r^nC_r = {}^nC_{n - r}
- If nCx=nCy^nC_x = {}^nC_y, then x=yx = y or x+y=nx + y = n
- Pascal's rule — nCr+nCr−1=n+1Cr^nC_r + {}^nC_{r - 1} = {}^{n + 1}C_r

Worked example. 10C3=10×9×83×2×1=120^{10}C_3 = \dfrac{10 \times 9 \times 8}{3 \times 2 \times 1} = 120, and 10C7=120^{10}C_7 = 120 as well.

Worked example 2. If nC8=nC6^nC_8 = {}^nC_6, then n=8+6=14n = 8 + 6 = 14, so 14C2=14×132=91^{14}C_2 = \dfrac{14 \times 13}{2} = 91.

Pascal's rule check. 5C2+5C1=10+5=15=6C2^5C_2 + {}^5C_1 = 10 + 5 = 15 = {}^6C_2.

An everyday example. Choosing 2 fillings from 5 for a dosa gives 5C2=10^5C_2 = 10 choices, and deciding which 3 to leave out gives the same 10.

The substance. Pascal's rule has a simple reason — a selection from n+1n + 1 items either includes one particular item or it does not.

How do you solve selection problems when all the items are different?

When all items are different, a selection is counted with nCr^nC_r; 'must include' and 'must exclude' conditions reduce n and r first, 'at least' conditions are handled by cases or by subtracting from the total, and there are 2n−12^n - 1 ways to choose at least one item from n.

Worked example. A committee of 5 is chosen from 6 boys and 4 girls.

-
Any 5
— 10C5=252^{10}C_5 = 252
- Exactly 2 girls — 4C2×6C3=6×20=120^4C_2 \times {}^6C_3 = 6 \times 20 = 120
- At least 1 girl — 252−6C5=252−6=246252 - {}^6C_5 = 252 - 6 = 246

Any number of items. Each of n items is either taken or left, so there are 2n2^n selections in all, or 2n−12^n - 1 if at least one must be taken. From 5 different books, at least one can be chosen in 25−1=312^5 - 1 = 31 ways.

An everyday example. Picking 3 elective subjects from a list of 8 can be done in 8C3=56^8C_3 = 56 ways.

The substance. 'At least one' is fastest by the complement — the total minus the selections with none.

How do you count selections when some of the items are identical?

If a collection has p identical items of one kind, q of another and r of a third, the number of selections containing at least one item is (p+1)(q+1)(r+1)−1(p + 1)(q + 1)(r + 1) - 1, and when n different items are also present the product is multiplied by 2n2^n before subtracting 1.

Why it works.
From p identical items you can take 0, 1, 2 and so on up to p — that is p+1p + 1 choices, not 2p2^p, because identical items cannot be told apart. Subtracting 1 removes the empty selection.

Worked example. A basket holds 3 identical mangoes, 4 identical bananas and 2 identical apples. The number of ways to take at least one fruit is

(3+1)(4+1)(2+1)−1=60−1=59(3 + 1)(4 + 1)(2 + 1) - 1 = 60 - 1 = 59

If the basket also holds 2 different oranges, the count becomes 4×5×3×22−1=2394 \times 5 \times 3 \times 2^2 - 1 = 239.

Worked example 2 (divisors). 360=23×32×5360 = 2^3 \times 3^2 \times 5 has (3+1)(2+1)(1+1)=24(3 + 1)(2 + 1)(1 + 1) = 24 divisors, because each divisor chooses how many of each prime factor to take.

An everyday example. Packing a tiffin from 5 identical rotis and 3 identical laddoos, with at least one item, gives 6×4−1=236 \times 4 - 1 = 23 possibilities.

The substance. Identical items give p+1p + 1 choices, different items give 2p2^p — mixing the two is the classic slip.

How do you solve mixed problems that combine permutations and combinations?

Mixed problems are solved in two stages: first select the items with combinations, then arrange the selected items with permutations, and multiply the two counts.

Worked example. How many 5-letter words with 2 different vowels and 3 different consonants can be formed from 5 vowels and 7 consonants?

- Select the vowels: 5C2=10^5C_2 = 10
- Select the consonants: 7C3=35^7C_3 = 35
- Arrange the 5 chosen letters: 5!=1205! = 120

10×35×120=42 00010 \times 35 \times 120 = 42\,000

Geometry link. 10 points with no three collinear determine 10C2=45^{10}C_2 = 45 lines and 10C3=120^{10}C_3 = 120 triangles, and a decagon has 45−10=3545 - 10 = 35 diagonals.

An everyday example. A housing society choosing a committee of 4 from 8 candidates and then naming a president and secretary from that committee has 8C4×4P2=70×12=840^8C_4 \times {}^4P_2 = 70 \times 12 = 840 possible outcomes.

The substance. Ask 'does order matter?' separately at each stage — selection and arrangement often occur in the same problem.
Exam tip

What earns full marks on combinations?

Write 'select' and 'arrange' as separate labelled steps in every mixed problem, so the examiner sees which formula belongs to which stage.

- nCr=n!r! (n−r)!^nC_r = \dfrac{n!}{r!\,(n - r)!} and nCr=nCn−r^nC_r = {}^nC_{n - r}
- 'At least one': the total minus none
- Identical items: (p+1)(q+1)−1(p + 1)(q + 1) - 1
- Mixed problems: combinations first, then permutations

The trap. Using nPr^nP_r for a committee. A committee has no order, so use nCr^nC_r.
Did you know

Why do 30 people shaking hands make 435 handshakes?

If everyone at a gathering of 30 people shakes hands with everyone else exactly once, there are 30C2=435^{30}C_2 = 435 handshakes — far more than most people guess.

The count grows roughly with the square of the number of people, because each new arrival shakes hands with everyone already there. Add just 10 more people and the handshakes jump to 40C2=780^{40}C_2 = 780.

The same counting explains why a round-robin tournament with many teams needs so many matches.
Exam relevance

How are combinations tested in JEE Main and JEE Advanced?

Permutations and Combinations is a recurring JEE Main chapter, and JEE Advanced combines it with probability and the binomial theorem.

What gets asked. Committee selections with conditions, counting divisors and selections of identical objects, geometry counts of lines, triangles and diagonals, and distributing objects into groups.

Question types. Numerical-value questions with a single count as the answer, and multiple-choice questions on identities such as Pascal's rule.

The trap that costs marks. Treating identical objects as different, which overcounts every selection.
Key takeaways

What must you be able to do from this lesson?

- Formula and identities: nCr=n!r! (n−r)!^nC_r = \dfrac{n!}{r!\,(n - r)!}, nCr=nCn−r^nC_r = {}^nC_{n - r} and Pascal's rule
- Different items: direct nCr^nC_r, with the complement for 'at least'
- Identical items: (p+1)(q+1)(r+1)−1(p + 1)(q + 1)(r + 1) - 1 selections
- Mixed problems: select with combinations, then arrange with permutations

How many triangles can be formed from 12 points in a plane if no three of them are collinear?

Ready to put this into practice?

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

Create your own quiz on CombinationsCreate a free account
← Back to all articles