Q.There are 3 books on Mathematics, 4 on Physics and 5 on English. How many different collections can be made such that each collection consists of: Match each item in Column C1 with its correct answer in Column C2. C1:
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Permutations Without Repetition
Permutations Without Repetition – The Idea of Arranging Things
Imagine you have three different books on a shelf: a Physics book, a Chemistry book, and a Maths book. How many different ways can you arrange them in a row?
You could try listing them out:
- Physics, Chemistry, Maths
- Physics, Maths, Chemistry
- Chemistry, Physics, Maths
- Chemistry, Maths, Physics
- Maths, Physics, Chemistry
- Maths, Chemistry, Physics
That's 6 arrangements. Notice that each arrangement uses all three books exactly once — no book is repeated, and no book is left out. This is the core idea: permutations without repetition count the number of ways to arrange a set of distinct objects in order, using each object exactly once.
Why "Without Repetition"?
The phrase "without repetition" means that once you place an object in a position, you cannot use it again. In our book example, once you put the Physics book in the first slot, you cannot put it in the second or third slot. Each object appears exactly once in the arrangement.
This is different from "permutations with repetition" (like creating 3-letter codes from the letters A, B, C where you can reuse letters — e.g., AAA, AAB, etc.). Here, no repeats allowed.
The Counting Logic – Why Multiply?
Let's build the arrangement step by step for 3 distinct books:
- First position: You have 3 choices (any of the 3 books).
- Second position: After placing the first book, only 2 books remain — so 2 choices.
- Third position: Only 1 book is left — so 1 choice.
Total arrangements = 3×2×1=6.
This product 3×2×1 is called 3 factorial, written as 3!.
P(n)=n!=n×(n−1)×(n−2)×⋯×2×1
For n distinct objects, the number of permutations (arrangements in order) is n!.
What If You Only Arrange Some of Them?
Suppose you have 5 different books, but you only want to arrange 3 of them on a shelf. How many ways?
- First position: 5 choices
- Second position: 4 choices
- Third position: 3 choices
Total = 5×4×3=60.
This is a permutation of 5 objects taken 3 at a time, written as P(5,3) or 5P3.
P(n,r)=(n−r)!n!=n×(n−1)×⋯×(n−r+1)
Here n is the total number of distinct objects, and r is how many you are arranging. The formula works because:
- Numerator n! counts all arrangements of all n objects.
- Denominator (n−r)! removes the arrangements of the n−r objects you are not using.
Key Points to Remember
- Order matters — swapping two objects gives a different permutation.
- No repetition — each object is used at most once.
- For arranging all n objects: n!
- For arranging r out of n objects: (n−r)!n!
Common Mistake to Avoid …
Concept: Counting collections using the multiplication principle and inclusion-exclusion.
We count the number of ways to select books from each subject independently, then combine appropriately.
- One book of each subject:
Choose exactly 1 Mathematics book from 3, exactly 1 Physics book from 4, and exactly 1 English book from 5. By the multiplication principle:
3×4×5=60
- At least one book of each subject: For Mathematics: each book can be included or excluded, giving 23=8 subsets, but we exclude the empty set, leaving 23−1=7 non-empty collections. Similarly, Physics gives 24−1=15 and English gives 25−1=31 non-empty collections. Total: 7×15×31=3255 …
(a) one of each subject =3×4×5=60; (b) at least one of each =(23−1)(24−1)(25−1)=3255; (c) at least one English =(25−1)2324=3968. Matches: (a)-(ii), (b)-(iii), (c)-(i).
We have 3 distinct Mathematics, 4 distinct Physics and 5 distinct English books.
(a) One book of each subject
Choose one from each subject independently:
3×4×5=60.
So (a) → (ii).
(b) At least one book of each subject
For a subject with k books the number of non-empty selections is 2k−1. Requiring at least one from each subject:
(23−1)(24−1)(25−1)=7×15×31=3255.
So (b) → (iii). …
Showing the 12 most recent of 18 on this concept.
- KEAM 2026Set eng-2026-04174 marksMCQQ.Let S be the set of all 3-digit numbers containing the digits 3, 5 and 7 without repetition. The sum of all numbers in S is (A) 3330 (B) 2220 (C) 4590 (D) 1110 (E) 4440
›Reveal solutionSolution
By symmetry each place-value column sums to 2×(3+5+7)=30, giving 30×111=3330. …
- KEAM 2026Set eng-2026-04174 marksMCQQ.There are 3 boys and 4 girls in a group. The number of ways they can sit in a row so that between any two boys there is a girl and between any two girls there is a boy, is (A) 88 (B) 96 (C) 124 (D) 144 (E) 288
›Reveal solutionSolution
The seating must strictly alternate; with 4 girls and 3 boys the pattern is fixed as GBGBGBG, giving 4!3!=144.
The conditions "between any two boys there is a girl" and "between any two girls there is a boy" together force a strictly alternating seating. With 3 boys and 4 girls in 7 seats, the only alternating arrangement is
GBGBGBG, …
- KEAM 2026Set eng-2026-04174 marksMCQQ.The number of arrangements of the letters of the word BANANA so that the arrangement starts and ends with the same letter, is (A) 12 (B) 16 (C) 18 (D) 20 (E) 24
›Reveal solutionSolution
Only A or N can occupy both ends; counting each case gives 12+4=16.
BANANA has letters A(×3),N(×2),B(×1). For an arrangement to start and end with the same letter, that letter must appear at least twice, so it is A or N.
- Both ends A: two A's used at the ends; the middle four positions hold {A,N,N,B}, arrangeable in 2!4!=12 ways. …
- KEAM 2026Set eng-2026-04204 marksMCQQ.If nP5=6720 and (n−1)P4=840, then nP3 is equal to (A) 346 (B) 348 (C) 396 (D) 376 (E) 336
›Reveal solutionSolution
nP5=(n−5)!n! and n−1P4=(n−5)!(n−1)!, so their ratio is n. Thus n=6720/840=8, giving nP3=8⋅7⋅6=336.
Use the permutation formulas:
nP5=(n−5)!n!,n−1P4=(n−5)!(n−1)!.
Dividing: …
- KEAM 2025Set eng-2025-04234 marksMCQQ.If 11Pr=7920, then the value of r is equal to (A) 7 (B) 6 (C) 5 (D) 4 (E) 3
›Reveal solutionSolution
11109*8 = 7920, so r = 4.
Concept and Intuition
The permutation P(n,r) is a product of r descending factors starting at n. Matching 7920 to such a descending product identifies r.
Step-by-Step Solution
- P(11, r) = 1110...*(11-r+1).
- 1110 = 110; 1109 = 990; 990*8 = 7920.
- That used four factors, so r = 4. …
- KEAM 2025Set eng-2025-04234 marksMCQQ.Let A={0,2,4,6,8}. The number of 5-digit numbers that can be formed using the digits in A without replacement, is (A) 120 (B) 96 (C) 88 (D) 64 (E) 32
›Reveal solutionSolution
From 5! total arrangements we remove the 4! that start with 0, leaving 96.
Concept and Intuition
Using all five distinct digits gives 5! orderings, but a valid 5-digit number cannot begin with 0. Subtract the arrangements with 0 in the leading position.
Step-by-Step Solution
- Total arrangements of {0,2,4,6,8} = 5! = 120.
- Arrangements with 0 leading = 4! = 24. …
- KEAM 2025Set eng-2025-04264 marksMCQQ.25 distinct objects are divided into 5 groups and each group consists of exactly 5 objects. Then the number of ways of forming such groups, is (A) (5!)525! (B) 5!25! (C) (5!)625! (D) (5!)425! (E) (5!)325!
›Reveal solutionSolution
Groups are of equal size and unlabelled, so divide by (5!)5 for internal order and by 5! for the interchange of the identical groups: (5!)625!. …
- KEAM 2025Set eng-2025-04274 marksMCQQ.The number of integers greater than 7000 using 2,4,6,7,8 without repetition, is (A) 168 (B) 336 (C) 196 (D) 256 (E) 512
›Reveal solutionSolution
Count 4-digit numbers starting with 7 or 8 (48) plus all 5-digit arrangements (120): total 168.
The available digits are 2,4,6,7,8 (all distinct, no repetition). A number using these digits and greater than 7000 is either a 4-digit or a 5-digit number.
4-digit numbers >7000: the thousands digit must be ≥7, so it is 7 or 8 (2 choices). The remaining three places are filled from the other 4 digits: …
- KEAM 2025Set eng-2025-04274 marksMCQQ.Five digit number is formed using the digits 0,1,2,3,4 and 5 without repetitions. Number of five digit numbers which are divisible by 10 is (A) 360 (B) 240 (C) 120 (D) 480 (E) 520
›Reveal solutionSolution
Fix the last digit as 0; the other four positions use the digits 1–5: P(5,4)=120.
A 5-digit number formed from {0,1,2,3,4,5} (no repetition) is divisible by 10 iff its units digit is 0.
Fixing the units digit as 0, the remaining four positions are filled by choosing and arranging 4 of the remaining 5 digits {1,2,3,4,5}: …
- KEAM 2025Set eng-2025-04284 marksMCQQ.If n(A)=8, then the number of subsets of A which contain 2 or 6 elements is (A) 24 (B) 28 (C) 48 (D) 56 (E) 216
›Reveal solutionSolution
Subsets with exactly 2 elements: (28)=28; with exactly 6: (68)=28. Total =56. …
- KEAM 2025Set eng-2025-04284 marksMCQQ.Four digit numbers are formed using 0, 3, 4, 5, 9, 8 without repetitions. Then the number of such 4 digits numbers is (A) 270 (B) 300 (C) 320 (D) 400 (E) 450
›Reveal solutionSolution
6 available digits {0,3,4,5,9,8}, no repetition. Leading digit can't be 0 (5 ways); fill remaining 3 places from the other 5 digits (5⋅4⋅3). Total =300.
For a 4-digit number the first (thousands) place cannot be 0, so it has 5 choices. …
- KEAM 2025Set eng-2025-04284 marksMCQQ.A bag contains 5 red balls, 4 black balls, and 3 white balls. Then the number of ways of selecting three balls at random that contains at least one white ball is (A) 220 (B) 210 (C) 180 (D) 136 (E) 74
›Reveal solutionSolution
At least one white = (all selections) − (no white) =(312)−(39)=220−84=136.
There are 5+4+3=12 balls. Choosing 3 in all: (312)=220. …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.