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 481-510 of 742 questions
Preparing practice and saved progress…
481
Medium
481 of 742
Application
+4 | -1
Ten persons, amongst whom are and to speak at a function. The number of ways in which it can be done, if wants to speak before and wants to speak before is
View answer and explanation
Correct option: A
Option A () is correct because A, B, and C can be arranged in 3! = 6 ways, but only one of these ways (A before B before C) is desired, so we divide the total permutations by 6.
482
Easy
482 of 742
Application
+4 | -1
The number of maps (functions) from the set into the set such that whenever , is
View answer and explanation
Correct option: A
84
Option A (84) is correct because it accurately calculates the number of non-decreasing functions from A to B by considering combinations with repetition.
483
Easy
483 of 742
Application
+4 | -1
How many even numbers of 3 different digits can be formed from the digits 1, 2, 3, 4, 5, 6, 7, 8, 9 (repetition of digits is not allowed)?
View answer and explanation
Correct option: A
224
Option A (224) is correct because it is the result of calculating the number of even numbers with 3 different digits from the given set, considering the last digit must be even.
484
Medium
484 of 742
Application
+4 | -1
In how many ways vertices of a square can be coloured with distinct colour if rotations are considered to be equivalent, but reflections are distinct?
View answer and explanation
Correct option: B
70
Option B (70) is correct because it applies Burnside's Lemma or Polya's Enumeration Theorem to count the distinct colorings of the vertices of a square under rotations, while keeping reflections distinct.
485
Easy
485 of 742
Application
+4 | -1
How many arrangements can be made out of the letters of the word " MOTHER" taken four at a time so that each arrangement contains the letter '
View answer and explanation
Correct option: A
240
Option A (240) is correct because it represents the number of arrangements of the letters in \"MOTHER\" taken four at a time, where each arrangement includes the letter 'M'.
486
Easy
486 of 742
Understanding
+4 | -1
The value of is
View answer and explanation
Correct option: B
Option B () is correct because the given sum is equivalent to the sum of binomial coefficients from r=1 to n, which equals .
487
Easy
487 of 742
Application
+4 | -1
There are 3 candidates for a post and one is to be selected by the votes of 7 men. The number of ways in which votes can be given, is
View answer and explanation
Correct option: B
Option B () is correct because each man has 3 choices for whom to vote, and there are 7 men.
488
Easy
488 of 742
Application
+4 | -1
The number of other ways in which the letters of the work SIMPLETON can be rearranged is
View answer and explanation
Correct option: C
9 ! -1
Option C (9 ! -1) is correct because it represents the number of rearrangements excluding the original word.
489
Medium
489 of 742
Application
+4 | -1
The number of quadratic expression with the coefficients drawn from set is
View answer and explanation
Correct option: C
48
Option C (48) is correct because the coefficient of the quadratic term cannot be zero, while the other coefficients can be any of the four given values.
490
Medium
490 of 742
Application
+4 | -1
The number of times the digit 5 will be written when listing the integers from 1 to 1000, is
View answer and explanation
Correct option: C
300
Option C (300) is correct because we count the occurrences of 5 in the units, tens, and hundreds places from 1 to 999.
491
Easy
491 of 742
Application
+4 | -1
Assuming that no two consecutive digits are same. The number of n digit numbers is
View answer and explanation
Correct option: C
Option C () is correct because each digit has 9 choices, and there are n digits.
492
Medium
492 of 742
Application
+4 | -1
Let satisfy then equals to
View answer and explanation
Correct option: B
4
Option C (101) is correct because it calculates the number of words preceding 'WATER' in the dictionary by considering the alphabetical order of the letters.
493
Easy
493 of 742
Analyzing
+4 | -1
The ten’s digit in is divisible by
View answer and explanation
Correct option: B
3!
Option B (3!) is correct because the ten's digit of the sum is 6, which is divisible by 3! (6).
494
Easy
494 of 742
Application
+4 | -1
Let and , then the number of functions , from to , which are onto is
View answer and explanation
Correct option: D
36
Option D (36) is correct because it uses the principle of inclusion-exclusion to subtract the non-onto functions from the total number of functions.
495
Medium
495 of 742
Application
+4 | -1
In how many ways can 15 members of a council sit along a circular table, when the Secretary is to sit on one side of the chairman and the Deputy Secretary on the other side?
View answer and explanation
Correct option: A
Option A () is correct because the Secretary and Deputy Secretary are fixed relative to the Chairman, and the remaining members are arranged in a circle.
Explore Other Chapters in MATHEMATICS
View All →
496
Easy
496 of 742
Application
+4 | -1
A total number of wards which can be formed out the letters taken 3 together such that each word contains at least one vowel, is
View answer and explanation
Correct option: C
96
Option C (48) is correct because it calculates the exponent of 3 in the prime factorization of 100! using Legendre's formula.
497
Easy
497 of 742
Application
+4 | -1
In how many ways can 21 English and 19 Hindi books be placed in a row so that no two Hindi books are together?
View answer and explanation
Correct option: A
1540
The correct answer is 1540 because it represents the number of ways to choose positions for the Hindi books among the English books.
498
Easy
498 of 742
Application
+4 | -1
The number of ways in which one can post 5 letters in 7 letters boxes is
View answer and explanation
Correct option: C
Option C () is correct because each of the 5 letters can be posted in any of the 7 boxes independently.
499
Medium
499 of 742
Application
+4 | -1
The total number of arrangements which can be made out of the letters of the word ‘Algebra’, without altering the relative position of vowels and consonants is
View answer and explanation
Correct option: D
Option D () is correct because it accounts for arranging the consonants and vowels separately, considering the repetition of the vowel 'A'.
500
Easy
500 of 742
Application
+4 | -1
From 4 gentlemen and 6 ladies, a committee of five is to be selected. The number of ways, in which the committee can be formed so that gentlemen are in majority, is
View answer and explanation
Correct option: A
66
Option A (66) is correct because the committee must have 3 or 4 gentlemen, and the number of ways to form the committee is .
501
Medium
501 of 742
Application
+4 | -1
If stands for , then sum of the series is
View answer and explanation
Correct option: A
Option A () is correct because the sum of the series can be simplified to a telescoping sum, resulting in (n+1)!.
502
Medium
502 of 742
Application
+4 | -1
The number of positive integral solutions of is
View answer and explanation
Correct option: A
Option A () is correct because it represents the number of positive integral solutions for the given equation using stars and bars method.
503
Easy
503 of 742
Application
+4 | -1
In an examination there are three multiple choice questions and each question has 4 choices. Number of ways in which a student can fail to get all answers correct, is
View answer and explanation
Correct option: D
63
Option D (63) is correct because it represents the total number of ways a student can answer the questions minus the one way to get all answers correct.
504
Easy
504 of 742
Application
+4 | -1
The Chief Minister of 11 states of India meet to discuss the language problem. The number of ways they can seat themselves at a round table so that Punjab and Chennai Chief Ministers sit together, is
View answer and explanation
Correct option: A
Option A () is correct because it treats the two Chief Ministers as one unit and accounts for their internal arrangement.
505
Easy
505 of 742
Application
+4 | -1
If !, then is equal to
View answer and explanation
Correct option: C
3
Option C (3) is correct because solving the factorial equation leads to n = 3.
506
Medium
506 of 742
Application
+4 | -1
How many numbers greater than 24000 can be formed by using the digits 1,2,3,4,5 when no digit is repeated , is
View answer and explanation
Correct option: C
84
Option C (84) is correct because it accounts for all numbers greater than 24000 formed without repetition.
507
Medium
507 of 742
Application
+4 | -1
The letters of the word 'RANDOM' are arranged in all possible ways. The number of arrangements in which there are 2 letters between and is
View answer and explanation
Correct option: C
144
Option C (144) is correct because it accounts for the positions of R and D with two letters in between, the arrangements of those two letters, and the arrangements of R and D themselves.
508
Easy
508 of 742
Application
+4 | -1
The number of five-digit numbers, greater than 40000 and divisible by 5 , which can be formed using the digits and 9 without repetition, is equal to
View answer and explanation
Correct option: B
120
Option B (120) is correct because it is the total number of five-digit numbers greater than 40000 and divisible by 5 that can be formed using the given digits without repetition.
509
Easy
509 of 742
Application
+4 | -1
The number of ways in which books can be arranged on a shelf so that two particular books shall not be together is
View answer and explanation
Correct option: A
!
Option D () is correct because the number of ways to arrange the guests is calculated by dividing them into two groups and arranging each group around a round table.
510
Medium
510 of 742
Application
+4 | -1
The number of words from the letters of the word 'BHARAT' in which and never come together is
View answer and explanation
Correct option: B
240
Option B (240) is correct because it subtracts the number of words where B and H are together from the total number of words.
Revision notes and key takeaways
Review PERMUTATION AND COMBINATION in your textbook or class notes, then use this set to check your understanding.
Showing 481-510 of 742 questions
