Skip to main content
Back to PERMUTATION AND COMBINATION

Your Progress

0 / 742 Answered
0
Correct
0
Incorrect
0%
Accuracy
JEE • MATHEMATICS • PERMUTATION AND COMBINATION

Permutation and combination practice · Mixed difficulty

Choose an answer to check it, or open “View answer” to study the explanation. Sign in to save progress to your account.

Practice format and chapter quiz

These sets use single-correct-answer MCQs. They do not cover every JEE Main or JEE Advanced question format and are not full-length mock papers.

Take a chapter quiz →
Showing 391-420 of 742 questions

Preparing practice and saved progress…

391 Easy
391 of 742
Application +4 | -1
If Pm{P_m} stands for   mPm{\;^m}{P_m}, then 1+1P1+2P2+3P3+...+n.Pn1 + 1{P_1} + 2{P_2} + 3{P_3} + ... + n.{P_n} is equal to
View answer and explanation
Correct option: D
(n+1)!\left( {n + 1} \right)!
Option D ((n+1)!\left( {n + 1} \right)!) is correct because the given sum simplifies to (n+1)!.
392 Easy
392 of 742
Understanding +4 | -1
2m2 m white counters and 2n2 n red counters are arranged in a straight line with (m+n)(m+n) counters on each side of a central mark. The number of ways of arranging the counters, so that the arrangements are symmetrical with respect to the central mark, is
View answer and explanation
Correct option: A
(m+n)!m!n!\frac{(m+n) !}{m ! n !}
Option A ((m+n)!m!n!\frac{(m+n) !}{m ! n !}) is correct because it represents the number of ways to arrange m white and n red counters on one side of the central mark, determining the entire symmetrical arrangement.
393 Easy
393 of 742
Application +4 | -1
Number of ways of selection of 4 letters of the word "PERFECT" is
View answer and explanation
Correct option: C
2525
Option C (25) is correct because it correctly counts the number of ways to select 4 letters from the word \"PERFECT\", considering the repeated letter E.
394 Easy
394 of 742
Analyzing +4 | -1
The value of 2n[1.3.5…(2n−3)(2n−1)]{2^n}\left[ {1.3.5 \ldots \left( {2n - 3} \right)\left( {2n - 1} \right)} \right] is
View answer and explanation
Correct option: A
(2n)!n!\frac{{\left( {2n} \right)!}}{{n!}}
Option A ((2n)!n!\frac{{(2n)!}}{{n!}}) is correct because the expression can be manipulated to match the factorial form.
395 Medium
395 of 742
Application +4 | -1
The number of words which can be made out of the letters of the word “MOBILE” when consonants always occupy odd places, is
View answer and explanation
Correct option: B
36
The correct answer is 36 because there are 3! ways to arrange the consonants in the odd places and 3! ways to arrange the vowels in the even places.
396 Easy
396 of 742
Application +4 | -1
There are stalls for 10 animals in a ship. The number of ways the shipload can be made if there are cows, calves and horses to be transported, animals of each kind being not less than 10 , is
View answer and explanation
Correct option: A
59049
Option A (59049) is correct because each stall can be filled in 3 ways, and there are 10 stalls, resulting in 3 to the power of 10.
397 Easy
397 of 742
Analyzing +4 | -1
The number of ways of arranging mm numbers out of 1,2,3,…,n1,2,3, \ldots, n, so that maximum is (n−2)(n-2) and minimum is 2 (repetitions of numbers is allowed) such that maximum and minimum both occur exactly once (n>5,m>3)(n > 5, m > 3), is
View answer and explanation
Correct option: C
m(m−1)(n−5)m−2m(m-1)(n-5)^{m-2}
Option C (m(m−1)(n−5)m−2m(m-1)(n-5)^{m-2}) is correct because it represents the number of ways to arrange mm numbers with the given constraints, considering the positions of the minimum and maximum values and the choices for the remaining numbers.
398 Medium
398 of 742
Application +4 | -1
How many words can be formed by using 2 consonant and 2 vowels from the word. 'TOMORROW'.
View answer and explanation
Correct option: C
78
Option C (78) is correct because it accounts for the combinations of selecting 2 consonants and 2 vowels, considering repetitions.
399 Easy
399 of 742
Understanding +4 | -1
The number of ways in which 10 candidates A1,A2,…A_1, A_2, \ldots, A10A_{10} can be ranked so that A1A_1 is always above A2A_2, is
View answer and explanation
Correct option: B
10 ! 2\frac{10 \text { ! }}{2}
The correct answer is B (10 ! 2\frac{{10 \text { ! }}}{{2}}) because half of the total permutations will have A1A_1 above A2A_2, and the other half will have A2A_2 above A1A_1.
400 Easy
400 of 742
Application +4 | -1
If   18C15+2(  18C16)+  17C16+1=  nC3{\;^{18}}{C_{15}} + 2\left( {{\;^{18}}{C_{16}}} \right) + {\;^{17}}{C_{16}} + 1 = {\;^n}{C_3}, then nn is equal to
View answer and explanation
Correct option: B
20
Option B (20) is correct because simplifying the given expression using combination identities leads to 20C3^{20}C_3, thus n = 20.
401 Easy
401 of 742
Application +4 | -1
In a group of 8 girls, two girls are sisters. The number of ways in which the girls can sit in a row so that two sisters are not sitting together is
View answer and explanation
Correct option: D
30240
Option D (30240) is correct because it calculates the total number of ways 8 girls can sit minus the number of ways the two sisters sit together, resulting in 8! - 2 * 7! = 30240.
402 Easy
402 of 742
Application +4 | -1
Given that n\mathrm{n} is odd, the number of ways in which three numbers in A.P. can be selected from 1,2,3,….n1,2,3, \ldots . \mathrm{n} is
View answer and explanation
Correct option: D
(n−1)24\frac{(\mathrm{n}-1)^2}{4}
Option D ((n−1)24\frac{{(n-1)^2}}{{4}}) is correct because it accounts for selecting two even or two odd numbers from the set to form an arithmetic progression.
403 Easy
403 of 742
Application +4 | -1
The number of ways in which 10 examination papers can be arranged so that the best and the worst papers never come together, is
View answer and explanation
Correct option: B
8.9 !
Option B (8.9 !) is correct because it calculates the total arrangements minus the arrangements where the best and worst papers are together.
404 Easy
404 of 742
Application +4 | -1
The number of mappings (functions) from the set A={1,  2,  3}A = \left\{ {1,\;2,\;3} \right\} into the set B={1,  2,  3,  4,  5,  6,  7}B = \left\{ {1,\;2,\;3,\;4,\;5,\;6,\;7} \right\} such that f(i)≤f(j)f\left( i \right) \le f\left( j \right) whenever i<ji < j, is
View answer and explanation
Correct option: A
84
Option A (84) is correct because it represents the number of non-decreasing functions from A to B, calculated by stars and bars method or combinations with repetition.
405 Easy
405 of 742
Application +4 | -1
S1,  S2,…,S10{S_1},\;{S_2}, \ldots ,{S_{10}} are the speakers in a conference. If S1{S_1} addresses only after S2{S_2}, then the number of ways the speakers address is
View answer and explanation
Correct option: D
10!2!\frac{{10!}}{{2!}}
Option D (10!2!\frac{{10!}}{{2!}}) is correct because S1{S_1} addresses only after S2{S_2}, so the total arrangements are divided by 2.
406 Easy
406 of 742
Application +4 | -1
4 buses runs between Bhopal and Gwalior. If a man goes from Gwalior to Bhopal by a bus and comes back to Gwalior by another bus, then the total possible ways are
View answer and explanation
Correct option: A
12
Option A (12) is correct because the man has 4 choices for going and then 3 choices for returning on a different bus.
407 Medium
407 of 742
Application +4 | -1
Total number of words that can be formed using the alpha- bets of the word 'KUBER', so that no alphabet is repeated in any of the formed word, is equal to
View answer and explanation
Correct option: A
325
Option A (325) is correct because it sums the number of words of length 1 to 5 that can be formed from the letters of 'KUBER' without repetition.
408 Easy
408 of 742
Application +4 | -1
A delegation of five students is to be formed from a group of 10 students. If three particular students want to remain together whereas two particular students do not want to remain together, then the number of selection is
View answer and explanation
Correct option: B
20
Option B (20) is correct because by considering the cases where the three particular students are always together and the two particular students are never together, the total number of selections is 20.
409 Easy
409 of 742
Application +4 | -1
The number of permutations of nn different objects taken r(≥3)r(\geq 3) at a time which include 3 particular objects, is
View answer and explanation
Correct option: D
rP3,n−3Pr−3{ }^r P_3,{ }^{n-3} P_{r-3}
The correct answer is D (rP3,n−3Pr−3{ }^r P_3,{ }^{n-3} P_{r-3}) because it represents the number of ways to arrange 3 particular objects in r places and then arrange the remaining objects.
410 Easy
410 of 742
Application +4 | -1
Rakshit is allowed to select 1 or more books out of (2n+1)(2 n+1) distinct books. If the number of ways in which he may not select all of them is 126, then value of n{n} is ___.
View answer and explanation
Correct option: A
3
Option A (3) is correct because the value of n is found by solving the equation derived from the given condition about selecting books.
411 Medium
411 of 742
Analyzing +4 | -1
If E=14⋅26⋅38⋅410…3062⋅3164=8xE=\frac{1}{4} \cdot \frac{2}{6} \cdot \frac{3}{8} \cdot \frac{4}{10} \ldots \frac{30}{62} \cdot \frac{31}{64}=8^x, then value of xx is
View answer and explanation
Correct option: D
−12-12
Option D (-12) is correct because after simplifying the expression for E, it becomes 2−362^{-36} which is equivalent to 8−128^{-12}.
412 Easy
412 of 742
Application +4 | -1
The number of all the possible selections which a student can make for answering one or more questions out of eight given questions in a paper, when each question has an alternative is
View answer and explanation
Correct option: B
6560
Option B (6560) is correct because each question has 3 options (answer the first part, answer the second part, or omit the question), and we subtract 1 to exclude the case where all questions are omitted.
413 Easy
413 of 742
Application +4 | -1
Find the no. of Permutations of all the letters of the word MATHEMATICS which starts with consonants only
View answer and explanation
Correct option: A
7×10!8\frac{7 \times 10 !}{8}
Option A (7×10!8\frac{7 \times 10 !}{8}) is correct because it calculates the number of permutations of MATHEMATICS starting with a consonant.
414 Easy
414 of 742
Application +4 | -1
A man has got seven friends. The number of ways in which he can invite one or more of his friends to dinner, is
View answer and explanation
Correct option: C
127
Option B (1024) is correct because each of the 5 men can vote for any of the 4 candidates, leading to 454^5 possible ways.
415 Medium
415 of 742
Application +4 | -1
If nCr−1=(k2−8)(n+1Cr){ }^n C_{r-1}=\left(k^2-8\right)\left({ }^{n+1} C_r\right), then kk belongs to
View answer and explanation
Correct option: C
[−3,−22)∪(22,3][-3,-2 \sqrt{2}) \cup(2 \sqrt{2}, 3]
Option C ([-3,-2 2\sqrt{2}) ∪(2 2\sqrt{2}, 3]) is correct because it correctly determines the range of k based on the given condition and the properties of combinations.
416 Medium
416 of 742
Application +4 | -1
If the letters of the word SACHIN are arranged in all possible ways and these words are written out as in dictionary, then the word SACHIN appears at serial number is
View answer and explanation
Correct option: A
601
Option A (601) is correct because it calculates the rank of the word SACHIN based on dictionary order.
417 Easy
417 of 742
Application +4 | -1
If m+nP2=90{ }^{m+n} P_2=90 and m−nP2=30,{ }^{m-n} P_2=30, then (m,n)(m, n) is given by
View answer and explanation
Correct option: D
(8,2)
Option D ((8,2)) is correct because it is derived by solving the permutation equations for m and n.
418 Easy
418 of 742
Application +4 | -1
The number of 5 digits telephone number having at least one of their digits repeated, is
View answer and explanation
Correct option: D
69760
Option D (69760) is correct because it is calculated by subtracting the number of 5-digit telephone numbers with no repeated digits from the total number of 5-digit telephone numbers.
419 Easy
419 of 742
Application +4 | -1
9 balls are to be placed in 9 boxes and 5 of the balls cannot fit into 3 small boxes. The number of ways of arranging one ball in each of the boxes is
View answer and explanation
Correct option: C
17280
Option C (17280) is correct because it accounts for the restriction of 5 balls not fitting into 3 boxes.
420 Easy
420 of 742
Application +4 | -1
The number of different permutations of the word ‘BANANA’ is
View answer and explanation
Correct option: D
60
Option D (60) is correct because it accounts for the repetitions of the letters A and N in the word BANANA.
Revision notes and key takeaways

Review PERMUTATION AND COMBINATION in your textbook or class notes, then use this set to check your understanding.

Showing 391-420 of 742 questions

Your practice

0 / 742 answered · 742 remaining · 0% accuracy

Progress is stored on this device. Sign in to save to your account.

✓ Correct · ✗ Incorrect · ○ Unanswered

Practice settings

Type at least 2 characters or jump directly:
🔓

Save your learning progress

Sign in with a free account to save your practice answers and quiz results, then return to them when you revise.