Mixed and applied problems
The hardest combinatorics questions combine permutations and combinations in a single problem. Mastery comes from a structured approach: first decide what must be selected, then how it must be arranged, and finally use the multiplication principle to combine.
A four-step strategy
For any combinatorial word problem:
- Read carefully. Identify the objects and the constraints.
- Decompose. Break the task into independent stages of selection and arrangement.
- Apply formulas. Use for selections and or factorials for arrangements.
- Multiply (for "and") or add (for disjoint "or") the stage results.
Common problem types
Word problems with letter constraints
- All vowels together: glue them.
- No two vowels together: place consonants first; insert vowels in the gaps.
Committee / team problems
- "At least of type X": sum over admissible counts, or use complement.
- "At most ": similar.
- "Exactly ": one specific count.
Geometry problems
- Lines through pairs of points: .
- Triangles from points (no three collinear): .
- Diagonals of an -gon: .
Number-formation problems
- -digit numbers from digits: if no repetition (and possible leading-zero adjustment).
- Even / odd numbers: fix the last digit first.
- Divisible by : last digit must be or .
Worked examples
Example 1. From a group of men and women, in how many ways can a committee of men and women be formed if a particular woman, , must be on the committee?
is fixed. Choose more woman from the remaining : . Choose men from : . Total: .
Example 2. How many words can be formed from the letters of "ARRANGE" so that the two 's do not come together?
Letters: , letters with twice and twice.
Total arrangements: .
Arrangements with both 's together: glue , arrange , which is objects with twice: .
Required: .
Example 3. A bag has red and green balls. In how many ways can balls be drawn so that (a) all are red, (b) all are green, (c) two of each colour, (d) at least one is red?
(a) .
(b) .
(c) .
(d) Total -draws: . None red: . At least one red: .
Example 4. From points in a plane, no three collinear, find the number of (a) lines, (b) triangles.
(a) lines.
(b) triangles.
Example 5 (harder). How many ways can boys and girls be arranged in a row so that no two girls are adjacent?
Place the boys first: ways. Boys create gaps (before, between, and after them: ). Choose of these gaps for the girls: . Arrange the girls in those gaps: .
Total: .
Try it yourself
- How many ways can players for a cricket team be chosen from if the captain is fixed?
- In a group of , in how many ways can a President, Vice-President and Secretary be chosen (distinct roles)?
- How many words with all letters distinct can be formed from if no word begins with ?
- How many committees of from men and women contain (a) exactly men, (b) at least men, (c) at most men?
- How many four-digit even numbers can be made from with no repetition?
- How many ways can the letters of "PERMUTATIONS" be arranged so that (a) all vowels are together, (b) the relative order of vowels and consonants is unchanged?
- From points in a plane, of which are collinear, find the number of lines.
- How many triangles are formed in the situation of (7)?
- In how many ways can identical red and identical blue balls be arranged in a row?
- How many -digit numbers are even and have all distinct digits from –?
- From Indian, American and Chinese members, how many delegations of have at least one Indian?
- Find such that .
Pitfalls / Tricks
- Always classify: selection vs arrangement. Many wrong answers come from picking the wrong type of formula.
- "At least one" = total minus "none".
- For arrangements where some items must not be adjacent, place the others first and insert into gaps.
- Insight. When stuck, write out the case structure first. For instance "at least men in committee of from " means: M+W, M+W, M+W. Sum the three.