Chapter 4 โ Permutations and Combinations
How many ways? Arrangements, where order matters, and selections, where it does not โ the fundamental principle of counting, ${}^{n}P_{r}$ and ${}^{n}C_{r}$, and the techniques that turn a counting question into a short calculation.
Shuffle an ordinary pack of $52$ playing cards well. The order you are holding has almost certainly never existed before in the history of the world, and will never exist again. That sounds like an exaggeration until you count: the number of possible orders is $52!$, a number with $68$ digits. If every person who has ever lived had shuffled a pack once a second since the beginning of the universe, they would not have come remotely close to producing every order even once. Counting can reveal facts that no amount of listing ever could.
The mathematics of counting โ combinatorics โ was developed by gamblers, astronomers and code-makers, from the Indian mathematicians who counted metres in poetry and the possible flavours from a set of spices, to Pascal and Fermat working out how to share the stakes of an unfinished game. Today it underlies probability and statistics, the design of passwords and error-correcting codes, the scheduling of tournaments and timetables, and the analysis of algorithms. In JEE Main it appears directly in one or two questions every year, and it is the engine of the binomial theorem (Chapter 5) and of probability (Chapter 13). Section 4.1 builds everything from the fundamental principle of counting and counts arrangements (permutations); Section 4.2 counts selections (combinations) and applies them to committees, geometry, groups and distributions.
- use the multiplication and addition principles, filling the most restricted place first and splitting into cases when the options depend on earlier choices;
- work with factorials and with ${}^{n}P_{r}=\tfrac{n!}{(n-r)!}$, including arrangements with repetition ($n^r$) and equations in $n$ and $r$;
- count arrangements of objects that are not all different, $\tfrac{n!}{p_1!\,p_2!\cdots}$, and arrangements with "together", "never together" and fixed-place conditions;
- count circular arrangements, $(n-1)!$ and $\tfrac{(n-1)!}{2}$, and find the rank of a word in dictionary order;
- use ${}^{n}C_{r}=\tfrac{n!}{r!(n-r)!}$ with its properties (symmetry, Pascal's rule) and decide whether a problem asks for a selection or an arrangement;
- count selections with conditions ("at least", "at most", particular objects included or excluded), all selections, and divisors of a number;
- count lines, triangles, diagonals and parallelograms, allowing for collinear points;
- divide objects into groups, and count integer solutions of $x_1+\cdots+x_k=n$ by stars and bars;
- solve JEE Main multiple-choice and numerical-answer problems on the whole unit.
A computer lists every possible order of $20$ students in a queue, at one billion orders per second. Roughly how long does it take?
Sections in this chapter
Counting Principle and Permutations
The fundamental principle of counting, factorials, permutations as arrangements and the meaning of ${}^{n}P_{r}$; repeated objects, restrictions, round tables and dictionary rank.
Combinations and Applications
Combinations as selections and the meaning of ${}^{n}C_{r}$; Pascal's rule, conditional selections, divisors, geometric counting, groups and stars and bars.
Eight problems that mix both sections, in no particular order โ just as they come in the paper, where nothing tells you whether a question wants arrangements or selections. Answer each one and press Submit (NTA marking: $+4$ correct, $-1$ wrong, $0$ unanswered), or press โฑ Take as a timed test for the real-exam experience: $8$ questions at the JEE Main pace of $2.4$ minutes each, with the NTA question palette.
E1. JEE Main ยท MCQ The number of arrangements of the letters of the word $\text{ARRANGE}$ in which the two $R$'s are not next to each other is (A) $900$ (B) $1260$ (C) $360$ (D) $720$
E2. JEE Main ยท Numerical Find the number of four-digit numbers whose digits are strictly increasing from left to right (for example $1358$). Give the answer to the nearest integer.
E3. JEE Main ยท MCQ Five boys and five girls sit around a round table so that boys and girls alternate. The number of ways is (A) $2\cdot5!\cdot5!$ (B) $4!\cdot4!$ (C) $4!\cdot5!$ (D) $5!\cdot5!$
E4. JEE Main ยท Numerical Three vertices of a regular $12$-sided polygon are chosen. Find the number of choices for which the three vertices form a right-angled triangle. Give the answer to the nearest integer.
E5. JEE Main ยท MCQ A committee of $4$ is chosen from $5$ married couples so that no couple serves together. The number of committees is (A) $210$ (B) $120$ (C) $60$ (D) $80$
E6. JEE Main ยท Numerical Find the number of five-digit numbers divisible by $4$ that use each of the digits $0,1,2,3,4$ exactly once. Give the answer to the nearest integer.
E7. JEE Main ยท MCQ The number of ordered triples $(x,y,z)$ of positive integers with $xyz=30$ is (A) $9$ (B) $27$ (C) $10$ (D) $6$
E8. JEE Main ยท Numerical In how many ways can $10$ identical balls be placed in $4$ different boxes so that no box is empty? Give the answer to the nearest integer.