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 331-360 of 742 questions

Preparing practice and saved progress…

331 Medium
331 of 742
Application +4 | -1
The number of numbers between 2,000 and 5,000 that can be formed with the digits 0,1,2,3,40,1,2,3,4, (repetition of digits is not allowed) and are multiple of 3 is?
View answer and explanation
Correct option: A
30
Option A (30) is correct because by considering all possible cases for the thousands digit (2, 3, or 4) and ensuring the sum of the digits is divisible by 3, we find a total of 30 such numbers.
332 Easy
332 of 742
Application +4 | -1
An urn contains 3 red pens, 4 green pens and 6 yellow pens. The number of ways of drawing 4 pens from the urn, if atleast one red pen is to be included in the draw, is (all the pens are different from each other)
View answer and explanation
Correct option: B
505
Option B (505) is correct because it calculates the total ways to choose 4 pens minus the ways to choose 4 pens without any red pens, which is 13C4−10C4=505{}^{13}C_4 - {}^{10}C_4 = 505.
333 Easy
333 of 742
Application +4 | -1
The number of functions ff from the set A={0,1,2}A=\{0,1,2\} into the set B={0,1,2,3,4,5,6,7}B=\{0,1,2,3,4,5,6,7\} such that f(i)≤f(j)f(i) \leq f(j) for i<ji < j and i,j∈Ai, j \in A, is
View answer and explanation
Correct option: C
10C3{ }^{10} C_3
Option C (10C3{ }^{10} C_3) is correct because it accurately represents the number of non-decreasing functions from A to B using combinations with repetition.
334 Medium
334 of 742
Application +4 | -1
The letters of the word 'VICTORY' are arranged in all possible ways, and the words thus obtained are arranged as in a dictionary. Then the rank of given word is
View answer and explanation
Correct option: A
3733
Option A (3733) is correct because it calculates the rank of the word VICTORY based on dictionary order.
335 Medium
335 of 742
Application +4 | -1
If the words formed by using the letters of the word 'AGAIN' are arranged in the form of dictionary, then 50th 50^{\text {th }} word is
View answer and explanation
Correct option: B
NAAIG
Option B (NAAIG) is correct because when the words formed by the letters of 'AGAIN' are arranged in dictionary order, the 50th word is NAAIG.
336 Easy
336 of 742
Application +4 | -1
How many words can be made from the letters of the word DELHI, if LL comes in the middle of every word?
View answer and explanation
Correct option: B
24
Option B (24) is correct because the number of words is calculated by arranging the remaining letters around the fixed letter L.
337 Easy
337 of 742
Application +4 | -1
Let T4\mathrm{T}_4 denotes the number of triangles which can be formed by using the vertices of a regular polygon of nn sides, If Tn+1−Tn=21T_{n+1}-T_n=21, then nn equals.
View answer and explanation
Correct option: A
7
Option A (7) is correct because solving the equation Tn+1−Tn=21T_{n+1} - T_n = 21 where Tn=nC3T_n = nC3 leads to n = 7.
338 Medium
338 of 742
Application +4 | -1
From 5 consonants, 4 vowels and 3 capital letters, the number of words beginning with a capital letter and containing 3 consonants and 2 vowels that can be made is
View answer and explanation
Correct option: B
21600
Option B (21600) is correct because it represents the number of words that can be made with the given constraints.
339 Easy
339 of 742
Application +4 | -1
The number of diagonals that can be drawn by joining the vertices of an octagon is
View answer and explanation
Correct option: C
20
Option A (20) is correct because it calculates the number of ways to connect vertices minus the number of sides of the octagon.
340 Easy
340 of 742
Application +4 | -1
Find the number of chains that can be prepared using 5 different colored beads
View answer and explanation
Correct option: D
12×4\frac{1}{2} \times 4 !
Option D (12×4\frac{1}{2} \times 4 !) is correct because the number of ways to arrange n distinct objects in a circle is (n-1)!, and for a chain, we divide by 2 to account for flipping it over.
341 Easy
341 of 742
Application +4 | -1
There are three piles of identical yellow, black and green balls and each pile contains at least 20 balls. The number of ways of selecting 20 balls if the number of black balls to be selected is twice the number of yellow balls, is
View answer and explanation
Correct option: B
7
Option B (7) is correct because it represents the number of possible values for the number of yellow balls that satisfy the given conditions.
342 Easy
342 of 742
Application +4 | -1
nn lines are drawn in a plane such that no two of them are parallel and no three of them are concurrent. The number of different points at which these lines will cut, is
View answer and explanation
Correct option: D
None of these
Option D (None of these) is correct because the number of intersection points is given by nC2{}^nC_2, which is not equal to any of the given options.
343 Easy
343 of 742
Application +4 | -1
5 different objects are to be distributed among 3 persons such that no two persons get the same number of objects. Number of ways this can be done, is
View answer and explanation
Correct option: B
90
Option B (90) is correct because the total number of ways to distribute the objects is the sum of the ways for the two possible distributions (0,1,4) and (0,2,3).
344 Easy
344 of 742
Application +4 | -1
The number of ways by which letter of word ASSASSINATION can be arranged such that all vowels come together is:
View answer and explanation
Correct option: C
8!6!4!(2!)23!\frac{8 ! 6 !}{4 !(2 !)^2 3 !}
Option D (8!6!4!3!2!\frac{{8 ! 6 !}}{{4 ! 3 ! 2 !}}) is correct because it represents the number of arrangements of the letters in the word ASSASSINATION with all vowels together, considering repetitions.
345 Medium
345 of 742
Application +4 | -1
In how many ways can a student choose a program of 5 courses, if 9 courses are available and 2 specific courses are compulsory for every student?
View answer and explanation
Correct option: C
35
Option C (35) is correct because after fixing the 2 compulsory courses, we need to choose 3 courses out of the remaining 7, which can be done in 7C3=35{}^7C_3 = 35 ways.
346 Easy
346 of 742
Application +4 | -1
A telegraph has 5 arms and each arm is capable of 4 distinct positions, including the position of rest. The total number of signals that can be made is
View answer and explanation
Correct option: B
1023
Option B (1023) is correct because each arm has 4 possible states, and we subtract 1 to exclude the case where all arms are at rest.
347 Easy
347 of 742
Application +4 | -1
If all the words (with or without meaning having five letters, formed using the letters of the word SMALL and arranged as in a dictionary, then the position of the word SMALL is
View answer and explanation
Correct option: C
58th58 \mathrm{th}
Option C (58th) is correct because it correctly calculates the number of words that come before SMALL in the dictionary order and adds 1.
348 Medium
348 of 742
Analyzing +4 | -1
The number of rational numbers lying in the interval (2002,2003)(2002,2003) all whose digits after the decimal points are non-zero and are in decreasing order, is
View answer and explanation
Correct option: C
29−12^9-1
Option C (29−12^9-1) is correct because it represents the sum of ways to choose 1 to 9 digits from the set {1, 2, ..., 9} and arrange them in decreasing order.
349 Easy
349 of 742
Application +4 | -1
The total number of words that can be formed using all letters of the word 'RITESH' that neither begins with I nor ends with R\mathrm{R}, is
View answer and explanation
Correct option: A
504
Option A (504) is correct because it is the total number of arrangements minus those starting with I or ending with R, plus those starting with I and ending with R.
350 Easy
350 of 742
Application +4 | -1
The number of ways in which 10 boys and 10 girls can be seated in a row so that boys and girls alternate is
View answer and explanation
Correct option: A
3628800
Option D (None of these) is correct because the correct answer is 2 * (10!)2 which is not among the options.
351 Easy
351 of 742
Application +4 | -1
How many numbers with no more than three digits can be formed using only the digits 1 through 7 with no digit used more than once in a given number?
View answer and explanation
Correct option: A
259
Option A (259) is correct because it sums the number of 1-digit, 2-digit, and 3-digit numbers that can be formed using digits 1 through 7 without repetition.
352 Medium
352 of 742
Application +4 | -1
Two straight lines intersect at a point OO. Points A1,A2,…,AnA_1, A_2, \ldots, A_n are taken on one line and points B1,B2,…,BnB_1, B_2, \ldots, B_n on the other. If the point OO is not to be used, then the number of triangles that can be drawn using these points as vertices, is
View answer and explanation
Correct option: C
n2(n−1)n^2(n-1)
Option C (n2(n−1)n^2(n-1)) is correct because it represents the total number of triangles formed by subtracting the degenerate cases (3 points on the same line) from the total possible combinations.
353 Easy
353 of 742
Application +4 | -1
The number of integral solutions of x1+x2+x3=0x_1+x_2+x_3=0, with xi≥−5x_i \geq-5, is
View answer and explanation
Correct option: C
17C2{ }^{17} C_2
Option C (17C2{ }^{17} C_2) is correct because it represents the number of integral solutions of the given equation with the specified constraints, after transforming the variables to non-negative integers.
354 Medium
354 of 742
Application +4 | -1
The number of ways of selecting 4 letters from the word EXAMINATION, is
View answer and explanation
Correct option: A
136
Option A (136) is correct because it represents the total number of ways to select 4 letters considering repetitions of A, I, and N in the word EXAMINATION.
355 Easy
355 of 742
Analyzing +4 | -1
The number of different pairs of words (□□□□,□□□)(\square \square \square \square, \square \square \square) that can be made with the letters of the word 'STATICS' is
View answer and explanation
Correct option: B
1260
Option B (10 or 11) is correct because the number of groups is maximized when the group size is closest to half the total number of students.
356 Medium
356 of 742
Application +4 | -1
There are 5 boys and 3 girls. In how many ways can they be seated in a row, so that all the three girls do not sit together?
View answer and explanation
Correct option: D
50⋅6!50 \cdot 6 !
Option D (50⋅6!50 \cdot 6 !) is correct because it calculates the number of ways to seat 5 boys and 3 girls such that the 3 girls do not sit together by subtracting the arrangements where they sit together from the total arrangements.
357 Easy
357 of 742
Application +4 | -1
In how many ways can 5 boys and 5 girls sit in a circle so that no two boys sit together?
View answer and explanation
Correct option: B
4!×5!4! \times 5!
Option B (4!×5!4! \times 5!) is correct because it represents the arrangement of girls in a circle and boys in the spaces between them.
358 Medium
358 of 742
Analyzing +4 | -1
The total number of six-digit numbers that can be formed, having the property that every succeeding digit is greater than the preceding digit, is
View answer and explanation
Correct option: A
9C3{ }^9 C_3
Option A (9C3{ }^9 C_3) is correct because selecting 6 distinct digits from 1 to 9 uniquely determines the six-digit number with increasing digits.
359 Medium
359 of 742
Application +4 | -1
Value of n!(n−r)!\frac{n !}{(n-r) !} when n=6,r=2n=6, r=2 is 5m5{m}. The value of mm is
View answer and explanation
Correct option: A
6
Option A (6) is correct because when n=6n=6 and r=2r=2, n!(n−r)!\frac{n !}{(n-r) !} equals 30, which is 5×65 \times 6.
360 Easy
360 of 742
Application +4 | -1
The largest integer nn such that 33 ! is divisible by 2n2^n is
View answer and explanation
Correct option: B
31
Option B (31) is correct because it represents the largest integer n such that 33! is divisible by 2^n, calculated using Legendre's formula.
Revision notes and key takeaways

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

Showing 331-360 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.