Back to PERMUTATION AND COMBINATION
Your Progress
0 / 7 Answered
0
Correct
0
Incorrect
0%
Accuracy
JEE • MATHEMATICS • PERMUTATION AND COMBINATION
Permutation and combination practice · Hard
Try a question, then open “View answer” to check it. Sign in to submit answers and save progress.
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 →
1
Hard
1 of 7
Application
+4 | -1
Number of words of 4 letters that can be formed with the letters of the word IIT JEE, is
View answer and explanation
Correct option: C
102
Option C (102) is correct because it accounts for all possible combinations of 4-letter words formed using the letters of the word IIT JEE, considering repetitions.
2
Hard
2 of 7
Analyzing
+4 | -1
Let be a prime number such that . Let . The number of primes in the list , is
View answer and explanation
Correct option: D
None of these
The correct answer is D (None of these) because for each term in the list, is divisible by , making none of them prime.
3
Hard
3 of 7
Application
+4 | -1
In an examination, the maximum marks for each of three papers is and that for fourth paper is . Then, the number of ways in which a candidate can get marks, is
View answer and explanation
Correct option: B
Option B () is correct because it represents the number of ways a candidate can get 3n marks, considering the maximum marks for each paper.
4
Hard
4 of 7
Analyzing
+4 | -1
is equal to
View answer and explanation
Correct option: C
Option C () is the correct answer because the limit of the given expression as n approaches infinity is .
5
Hard
5 of 7
Application
+4 | -1
The number of ways of selecting objects out of objects, of which are alike and rest are different, is
View answer and explanation
Correct option: A
Option A () is correct because it represents the number of ways to select n objects out of 3n objects, where n are alike and the rest are different.
6
Hard
6 of 7
Analyzing
+4 | -1
Ten persons numbered play a chess tournament, each player playing against every player exactly one game. It is known that no game ends in a draw. Let be the number of games won by player respectively and , be the number of games lost by the players , 10 respectively, then
View answer and explanation
Correct option: C
Option C () is correct because in a tournament where each game has a winner and a loser, the sum of the squares of the wins equals the sum of the squares of the losses.
7
Hard
7 of 7
Application
+4 | -1
In how many ways 4 alphabets can be chosen from the word ASSASSINATION?
View answer and explanation
Correct option: B
72
Option D, 72, is correct because it represents the number of ways to choose 4 alphabets from the word ASSASSINATION.
Revision notes and key takeaways
Review PERMUTATION AND COMBINATION in your textbook or class notes, then use this set to check your understanding.
Key Takeaways
- ✓ This set contains 7 single-correct-answer MCQs on PERMUTATION AND COMBINATION.
- ✓ Try each question before opening its answer. Read the explanation where one is available.
- ✓ Sign in to save submitted answers. Revisit incorrect answers alongside your textbook or class notes.
Continue Your Practice
📚 Switch Set (HARD)
0
/7
0✓
0✗
0% Accuracy
