UKPSC PCS (Upper) · Module 71 · Mains depth · 16 min
Counting: permutations and combinations
What UKPSC PCS (Upper) asks from this chapter
Syllabus lines this chapter covers:
- Prelims Paper II: General Aptitude Test (qualifying, 33%) · Communication and interpersonal skills: word building, coding-decoding, numerical operations.
- Prelims Paper II: General Aptitude Test (qualifying, 33%) · General mental ability: direction sense, social and emotional intelligence, critical thinking, puzzles, alphabet test, data sufficiency, missing character.
- Prelims Paper II: General Aptitude Test (qualifying, 33%) · Numerical identification: numbers and their classification, divisibility, prime numbers, remainders, number series, sums of natural numbers.
4 UKPSC PCS (Upper) questions in our bank come from this module (Algebra, geometry and counting).
Read at full depth: basics, the standard layer and the Mains analysis.
Start from zero: a tree of choices
You have 3 shirts and 4 trousers. How many different outfits can you wear? For each shirt you can pick any of the 4 trousers, so there are 4 + 4 + 4 = 3 × 4 = 12 outfits. Add 2 pairs of shoes and every outfit splits two ways again, giving 24.
That is the multiplication principle: when one choice is followed by another, multiply the number of ways. If instead you go to a town by one of 3 buses or one of 2 trains, you make only one choice, so there are 3 + 2 = 5 ways. "And then" means multiply; "or" means add.
Every formula in this chapter grows from these two rules. Permutations and combinations are just quick ways to apply them when the choices are many.
Why this topic exists. Counting tells you how many passwords, vehicle numbers, committee options or schedules are possible. Planners use it to judge whether a code system has enough numbers, or how many ways a duty roster can be drawn up.
The counting principle at work
Codes with repetition. A 3-digit lock code uses digits 0 to 9, and digits may repeat. Each place has 10 choices, so there are 10 × 10 × 10 = 1,000 codes. A 4-letter code from the 26 letters with repetition allows 26⁴ = 4,56,976 codes.
Codes without repetition. If the digits must all be different, the first place has 10 choices, the second 9 and the third 8. So there are 10 × 9 × 8 = 720 codes. Each place loses one choice because one digit has been used up.
Restricted places first. How many 4-digit even numbers can be made from the digits 1 to 6 with no repetition? Fill the restricted place first: the last digit must be 2, 4 or 6, which is 3 ways. The remaining three places then take 5 × 4 × 3 ways, so there are 3 × 60 = 180 numbers.
Routes. If 3 roads go from A to B and 4 from B to C, a trip from A to C through B has 3 × 4 = 12 routes. If the return trip may not reuse any road, there are 3 unused roads from C to B and 2 from B to A, so the round trips number 12 × 3 × 2 = 72.
Why it matters. Many counting questions need nothing beyond this principle. Always handle the most restricted place first, because its choices do not depend on the others.
Arrangements: when order matters
Everyone in a row. Five people can stand in a row in 5 × 4 × 3 × 2 × 1 ways. This product is written 5! and read "5 factorial"; it equals 120. In general, n different things can be lined up in n! ways, and by agreement 0! = 1.
Some of them in order. To fill r ordered places from n people, multiply n × (n − 1) × … for r factors. This is written P(n, r) = n! ÷ (n − r)!. Choosing a president and a secretary from 8 members gives P(8, 2) = 8 × 7 = 56, because the two posts are different.
Letters that repeat. The word BANANA has 6 letters, but the three A's are identical and so are the two N's. Swapping the A's among themselves gives no new word, so divide by 3! and by 2!: 720 ÷ (6 × 2) = 60 arrangements. The word LEVEL gives 5! ÷ (2! × 2!) = 30.
Round a table. For people round a circular table, only their order relative to each other matters, since turning everyone one seat gives the same seating. Fix one person and arrange the rest: 6 people can sit in (6 − 1)! = 120 ways. The seating chapter uses the same idea.
Why it matters. Arrangement questions are the commonest kind in this topic. Most mistakes come from forgetting to divide for repeated letters or for turning a circle.
Selections: when order does not matter
From arranging to choosing. Picking a committee of 3 from 8 people is different from picking a president, secretary and treasurer. Arranging 3 of 8 gives 8 × 7 × 6 = 336, but each committee has been counted 3! = 6 times, once for each order of the same three people. So the number of committees is 336 ÷ 6 = 56.
The formula. Choosing r from n gives C(n, r) = n! ÷ (r! × (n − r)!). Choosing r to take is the same as choosing n − r to leave, so C(n, r) = C(n, n − r); for example C(10, 8) = C(10, 2) = 45. Use whichever is smaller to calculate.
Handshakes, lines and triangles. If 10 people each shake hands once with every other, each handshake is a choice of 2 people, so there are C(10, 2) = 45 handshakes. Nine points with no three on a line give C(9, 2) = 36 straight lines. Seven such points give C(7, 3) = 35 triangles, because any three points that are not in a line make a triangle.
Teams from groups. To choose 2 men from 5 and 2 women from 4, choose each group separately and multiply: C(5, 2) × C(4, 2) = 10 × 6 = 60 teams. The multiplication principle joins the two selections.
Why it matters. Committees, teams and handshakes are classic selection questions. The key test is simple: if swapping two chosen items gives the same result, order does not matter and you must use C.
Restrictions: together, apart and at least
Always together. Five people stand in a row, and A and B insist on standing together. Glue A and B into one block; now 4 units are arranged in 4! = 24 ways. Inside the block A and B can be AB or BA, so there are 24 × 2 = 48 arrangements.
Never together. Count all arrangements and subtract those where they are together. That gives 120 − 48 = 72. This "total minus the opposite" method is often far quicker than counting the wanted cases directly.
At least one. A committee of 3 is chosen from 6 men and 4 women, and it must include at least one woman. The total is C(10, 3) = 120, and the committees with no woman are C(6, 3) = 20. So 100 committees have at least one woman, with no need to add up the one-woman, two-women and three-women cases.
A common trap. Some students count "at least one woman" as 4 × C(9, 2): choose one woman, then any two others. That gives 144, which is too many, because a committee with two women is counted twice, once for each woman picked first. The subtraction method avoids this double counting.
Why it matters. Restrictions are where examiners separate careful counters from careless ones. Gluing and subtracting are the two tools that handle almost every restriction.
Choosing the right method
Two questions first. Ask whether order matters: posts, ranks, codes and queues care about order, while committees, teams and handfuls do not. Then ask whether repetition is allowed: digits in a PIN may repeat, but people in a queue cannot. These two answers point to multiply, P, or C.
Small cases to check. When unsure, shrink the problem and list everything. For "committees of 2 from A, B, C" you can write AB, AC and BC, which is 3 = C(3, 2); for "president and secretary from A, B, C" you get 6 ordered pairs, which is P(3, 2). If the formula matches the small list, trust it on the big one.
Overcounting and undercounting. Overcounting happens when the same outcome is reached in several orders, as in the at-least-one trap. Undercounting happens when you forget an internal arrangement, such as the AB and BA inside a glued block. A quick check of one specific outcome, asking "how many times did I count this?", catches both.
Big numbers are a feature. Counting answers grow very fast: 10 people can queue in 36,28,800 ways. That is why a short PIN is weak and a long password is strong, and why exams give small numbers and expect a formula rather than a list.
Why it matters. Planning duty rosters, assigning officers to posts or designing a numbering scheme are counting problems. The two-question habit gives a reliable method instead of guesswork.
Where and why this is asked
Why examiners test it. Counting tests clear thinking about cases: whether order matters, what is allowed and what must be excluded. These are the same habits needed to design fair procedures and avoid double counting in records.
Where it shows up. The union aptitude paper often asks counting questions in plain words, such as how many numbers, codes, routes or selections are possible, without naming permutations at all. State papers and recruitment tests also ask direct formula questions on arrangements of letters, committees and handshakes.
When it goes wrong. Common slips are using P where C is needed, forgetting to divide for repeated letters, forgetting the internal arrangement of a glued block, and double counting in at-least-one questions.
The habit to build. Ask the two questions, fill the most restricted place first, and use "total minus opposite" for any restriction that says never or at least. Check the method on a tiny case when you are unsure.
Exam lens: five question types and how to beat each
These are practice questions written by us, in the styles the papers use. Real past questions from your exam appear in the PYQ panel of this module.
Type 1: counting principle. "3 roads join A to B and 4 join B to C. How many routes go from A to C through B?" 3 × 4 = 12.
Type 2: letters with repeats. "In how many ways can the letters of LEVEL be arranged?" 5! ÷ (2! × 2!) = 30.
Type 3: committees. "How many committees of 3 can be formed from 8 people?" C(8, 3) = 56.
Type 4: at least one. "From 6 men and 4 women, how many 3-member committees have at least one woman?" 120 − 20 = 100.
Type 5: together. "In how many ways can 5 people stand in a row if two of them must be together?" 4! × 2 = 48.
Time plan. Types 1 to 3 should take 30 seconds each. Restriction questions take up to a minute and a half, mainly to decide between gluing and subtracting.
Practice set: twelve solved problems
Try each problem first, then read the steps. The problems go from easy to hard.
1. You have 3 shirts, 4 trousers and 2 pairs of shoes. How many outfits are possible?
3 × 4 × 2 = 24. The answer is 24.
2. How many 3-digit codes can be made from the digits 0 to 9 if no digit repeats?
10 × 9 × 8 = 720. The answer is 720.
3. In how many ways can 5 people stand in a row?
5! = 120. The answer is 120.
4. In how many ways can a president and a secretary be chosen from 8 members?
8 × 7 = 56. The answer is 56.
5. In how many ways can the letters of BANANA be arranged?
6! ÷ (3! × 2!) = 720 ÷ 12. The answer is 60.
6. How many committees of 3 can be chosen from 8 people?
8 × 7 × 6 ÷ 3! = 336 ÷ 6. The answer is 56.
7. If 10 people each shake hands once with every other person, how many handshakes take place?
C(10, 2) = 10 × 9 ÷ 2. The answer is 45.
8. How many triangles can be formed from 7 points, no three of which lie on a line?
C(7, 3) = 7 × 6 × 5 ÷ 6. The answer is 35.
9. In how many ways can 5 people stand in a row if two particular people must be together?
Glue them: 4! × 2 = 24 × 2. The answer is 48.
10. In how many ways can 5 people stand in a row if two particular people must never be together?
120 − 48 = 72. The answer is 72.
11. A 3-member committee is chosen from 6 men and 4 women. How many committees include at least one woman?
C(10, 3) − C(6, 3) = 120 − 20. The answer is 100.
12. How many 4-digit even numbers can be formed from the digits 1 to 6 without repetition?
The last digit has 3 choices, then 5 × 4 × 3 for the rest, so 3 × 60. The answer is 180.
Quick revision
- "And then" multiplies; "or" adds.
- Fill the most restricted place first.
- n things in a row: n!; r of n in order: P(n, r) = n! ÷ (n − r)!.
- Choose r of n: C(n, r) = n! ÷ (r! × (n − r)!); C(n, r) = C(n, n − r).
- Repeated letters: divide n! by the factorial of each repeat count.
- Round a table: (n − 1)!.
- Together: glue, then multiply by the inside arrangements.
- Never together or at least one: total minus the opposite case.
- Handshakes and lines: C(n, 2); triangles from points: C(n, 3).