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

← All study notes

Picking a Team of 3 From 10 Gives Six Times Fewer Ways Than Lining Them Up

Derive nCr and its link with nPr, use the properties of nCr to simplify and solve equations, count committees and teams under conditions, and decide when a problem needs permutations, combinations or both.

How is choosing different from arranging?

Choosing Asha, Bala and Chitra for a team is one selection, whatever order their names are written in. But making them captain, vice-captain and wicket-keeper gives 3!=63! = 6 different arrangements of the same three people.

A combination is a selection where order does not matter; a permutation is an arrangement where it does.


This part covers the combination formula, its properties, selection problems with conditions, and problems that need both ideas.

How do you derive nCr = n!/(r!(n - r)!) and relate it to nPr?

Each selection of rr objects can be arranged in r!r! ways, so nPr=nCr×r!{}^nP_r = {}^nC_r \times r!, which gives nCr=n!r!(n−r)!{}^nC_r = \frac{n!}{r!(n - r)!}.

Worked example 1.
From 1010 players:

10P3=10×9×8=72010C3=7203!=120{}^{10}P_3 = 10 \times 9 \times 8 = 720 \qquad {}^{10}C_3 = \frac{720}{3!} = 120

Six times fewer selections than arrangements, because each team of 33 can be lined up in 66 ways.

Worked example 2 — handshakes. Five people each shake hands once with every other:

5C2=5×42=10 handshakes{}^5C_2 = \frac{5 \times 4}{2} = 10 \text{ handshakes}

Worked example 3. 8C3=8×7×63×2×1=56{}^8C_3 = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = 56.

An everyday example. Choosing 22 toppings from 55 for a pizza gives 5C2=10{}^5C_2 = 10 choices, since onion-and-corn is the same as corn-and-onion.

The substance. nC0=nCn=1{}^nC_0 = {}^nC_n = 1: there is exactly one way to choose nothing, and one way to choose everything.

How do you use nCr = nC(n - r) and nCr + nC(r - 1) = (n + 1)Cr?

Choosing rr objects to take is the same as choosing n−rn - r to leave, so nCr=nCn−r{}^nC_r = {}^nC_{n-r}; and counting selections that include or exclude one particular object gives nCr+nCr−1=n+1Cr{}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r.

Worked example 1.


50C48=50C2=50×492=1225{}^{50}C_{48} = {}^{50}C_2 = \frac{50 \times 49}{2} = 1225

Worked example 2 — Pascal's rule.

8C3+8C2=56+28=84=9C3{}^8C_3 + {}^8C_2 = 56 + 28 = 84 = {}^9C_3

Worked example 3. If nC9=nC7{}^nC_9 = {}^nC_7, then 9+7=n9 + 7 = n, so n=16n = 16 and 16C2=120{}^{16}C_2 = 120.

Worked example 4. If 2nC3:nC3=11:1{}^{2n}C_3 : {}^nC_3 = 11 : 1:

2n(2n−1)(2n−2)n(n−1)(n−2)=114(2n−1)n−2=118n−4=11n−22n=6\frac{2n(2n - 1)(2n - 2)}{n(n - 1)(n - 2)} = 11 \qquad \frac{4(2n - 1)}{n - 2} = 11 \qquad 8n - 4 = 11n - 22 \qquad n = 6

An everyday example. Choosing 4848 of 5050 students to go on a trip is the same as choosing the 22 who stay back: 12251225 ways either way.

The substance. In Pascal's rule, a new object is either in the selection or not — the two cases add up to the whole count.

How do you solve selection problems on committees and teams with conditions?

Split the selection into groups according to the condition, use combinations within each group, multiply the choices, and add the separate cases — using the complement when at least is easier to count the other way.

Worked example 1. A committee of 33 from 22 men and 33 women with exactly 11 man and 22 women:

2C1×3C2=2×3=6{}^2C_1 \times {}^3C_2 = 2 \times 3 = 6

Worked example 2 — at least one of each. A team of 55 from 66 boys and 44 girls:

10C5−6C5=252−6=246{}^{10}C_5 - {}^6C_5 = 252 - 6 = 246

(an all-girl team is impossible, since there are only 44 girls).

Worked example 3 — at least 33 girls.

4C3⋅6C2+4C4⋅6C1=4×15+1×6=66{}^4C_3 \cdot {}^6C_2 + {}^4C_4 \cdot {}^6C_1 = 4 \times 15 + 1 \times 6 = 66

Worked example 4 — fixed players. An XI from 1515 players:

- A particular player always included: 14C10=1001{}^{14}C_{10} = 1001
- A particular player always excluded: 14C11=364{}^{14}C_{11} = 364

An everyday example. Selectors picking a school cricket XI with a fixed captain face exactly the third case.

The trap. For at least one boy and one girl, subtract the impossible cases rather than adding many separate ones.

How do you decide between permutations and combinations and solve problems that need both?

Ask whether swapping two chosen objects gives a different outcome: if yes, use permutations; if no, use combinations; when a problem selects and then arranges, multiply a combination by an arrangement count.

Worked example 1 — posts versus representatives. From 3030 students:

- President and secretary (different posts): 30P2=870{}^{30}P_2 = 870
- Two class representatives (same role): 30C2=435{}^{30}C_2 = 435

Worked example 2 — select then arrange. Words of 22 vowels and 33 consonants from INVOLUTE, which has vowels I,O,U,EI, O, U, E and consonants N,V,L,TN, V, L, T:

4C2×4C3×5!=6×4×120=2880{}^4C_2 \times {}^4C_3 \times 5! = 6 \times 4 \times 120 = 2880

Worked example 3 — geometry. With 1010 points, no three collinear:

lines=10C2=45triangles=10C3=120\text{lines} = {}^{10}C_2 = 45 \qquad \text{triangles} = {}^{10}C_3 = 120

An everyday example. A lucky draw with three identical prizes counts combinations of winners, while one with first, second and third prizes counts permutations.

The substance. A triangle is a selection of 33 points, since the same three points give the same triangle in any order.
Exam tip

What earns full marks on combinations?

Say in words whether order matters, write each case separately, and show the combination symbols before evaluating.

- nCr=n!r!(n−r)!{}^nC_r = \frac{n!}{r!(n - r)!} and nPr=nCr×r!{}^nP_r = {}^nC_r \times r!
-
Use nCr=nCn−r{}^nC_r = {}^nC_{n-r} to shorten calculations
-
Exactly conditions: multiply group choices
-
At least conditions: add cases or subtract from the total
-
Select then arrange: multiply by the number of arrangements

The trap.
Counting selections of 22 representatives as 30P2{}^{30}P_2. Swapping the two representatives gives the same pair, so use 30C2{}^{30}C_2.
Did you know

How unlikely is it to win a lottery that picks 6 numbers from 49?

A lottery draws 66 different numbers from 11 to 4949, in any order. The number of possible tickets is

49C6=49×48×47×46×45×446!=13983816{}^{49}C_6 = \frac{49 \times 48 \times 47 \times 46 \times 45 \times 44}{6!} = 13983816

So one ticket has a chance of about 11 in 1414 million. If order mattered, the count would be 6!=7206! = 720 times larger — which shows how much difference the choice between combinations and permutations makes.
Exam relevance

How are combinations tested in JEE Main and JEE Advanced?

Combinations are central to Permutations and Combinations in JEE Main and JEE Advanced, and they reappear as the coefficients of the Binomial Theorem and in counting outcomes in Probability.

What gets asked. Selections with restrictions, dividing objects into groups, counting lines, triangles and diagonals (nC2−n{}^nC_2 - n for an nn-sided polygon), and identities built on Pascal's rule.

Question types. Numerical-value and multiple-choice questions, frequently combining selection with arrangement.

The trap that costs marks. Double counting in at least problems, where the same selection is counted in more than one case.
Key takeaways

What must you be able to do from this part?

- nCr=n!r!(n−r)!{}^nC_r = \frac{n!}{r!(n - r)!}; nPr=nCr×r!{}^nP_r = {}^nC_r \times r!; 10C3=120{}^{10}C_3 = 120
- nCr=nCn−r{}^nC_r = {}^nC_{n-r}; 50C48=1225{}^{50}C_{48} = 1225
- Pascal's rule: 8C3+8C2=9C3=84{}^8C_3 + {}^8C_2 = {}^9C_3 = 84
- Conditions: exactly means multiply groups; at least means add cases or subtract
- Team of 55 with at least one boy and one girl: 246246
- Order matters: permutation; order does not matter: combination; select then arrange: multiply

Work out how many different handshakes happen when everyone in your class greets everyone else once.

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 2Create a free account
← Back to all articles