Permutations and Combinations - Class XI
Covers fundamental counting principles, permutations, and combinations for Class XI mathematics
Questions
From 0 to 9 , four digited numbers can be formed such that
the digits are in ascending order is
- ${}^{10}{P _4}$
- ${}^{10}{C _4}$
- ${}^{10}{P _4} - {}^9{P _3}$
- ${}^{10}{C _4} - {}^9{C _3}$
Total number of ways of selecting two numbers from the set ${1,2,3,...90}$ so that their sum is divisible by $3$ is
- $885$
- $1335$
- $1770$
- $3670$
If the letter of word $MOTHER$ are written in all possible orders and these words are written out as in a dictionary. Find the rank of the word $MOTHER$
- $307$
- $308$
- $309$
- $120$
There are $6$ boxes numbered $1, 2 ....... 6$. Each box is to be filled up either with a red or a green ball in such a way that at least $1$ box contains a green ball and the boxes containing green balls are consecutively numbered. The total number of ways in which this can be done is:
- $5$
- $21$
- $33$
- $60$
In Hyderabad there are 5 routes to Begumpet from Kukatpally and 9 routes to Dilsukhnagar from Begumpet In how many ways can a person travel from Kukatpally to Dilsukhnagar via Begumpet?
- $14$
- $4$
- $40$
- $45$
Rajdhani Express going from Bombay to Delhi stops at five intermediate stations, 10 passengers enter the train during the journey with 10 different ticket of two classes. The number of different sets of tickets they may have is
- $^{15}C _{10}$
- $^{20}C _{10}$
- $^{30}C _{10}$
- none of these
There are 8 teams in a certain league and each team plays each of the other teams exactly once. If each game is played by 2 teams, what is the total number of games played?
- 15
- 6
- 28
- 56
- 64
The number of $n$ digit numbers which consists of the digits $1$ & $2$ only if each digits is to be used atleast once, is equal to $510$ then $n$ is equal to
- $7$
- $8$
- $9$
- $10$
The number of ways in which three numbers in A.P. can be seleced from the set of first n natural number if n is odd is
- $ \displaystyle \frac{n\left ( n-2 \right )}{4} $
- $ \displaystyle \frac{n\left ( n-1 \right )^2}{4} $
- $ \displaystyle \frac{\left ( n-1 \right )^2}{4} $
- None of these
A college offers $7$ courses in the morning and $5$ courses in the evening. Find the number of ways a student can select exactly one course either in the morning or in the evening.
- $35$
- $12$
- $40$
- $30$
If $^nC _3=^nC _{13}$, then $^{20}C _n$ is.
- $1825$
- $3801$
- $4845$
- $300$
- $12$
- $6$
- $9$
- $3$
The number of rectangles that can be obtained by joining four of the twelve vertices of a $12$ sided regular polygon is
- $66$
- $30$
- $24$
- $15$