Permutations and Combinations
${S_1} = \left\{ {(i,j,k):i,j,k \in \{ 1,2,....,10\} } \right\}$,
${S_2} = \left\{ {(i,j):1 \le i < j + 2 \le 10,i,j \in \{ 1,2,...,10\} } \right\}$,
${S_3} = \left\{ {(i,j,k,l):1 \le i < j < k < l,i,j,k,l \in \{ 1,2,...,10\} } \right\}$ and
${S_4} = \{ (i,j,k,l):i,j,k$ and $l$ are distinct elements in {1, 2, ...., 10}.
If the total number of elements in the set Sr is nr, r = 1, 2, 3, 4, then which of the following statements is(are) TRUE?
A set contains 11 elements. The number of subsets of the set which contain at most 5 elements is
The value of ${ }^6 P_4+4 \cdot{ }^6 P_3$ is
The number of ways in which 3 boys and 2 girls can sit on a bench so that no two boys are adjacent is
In how many ways can 5 balls be placed in 4 tins if any number of balls can be placed in any tin?
For $1 \leq r \leq n, \frac{1}{r+1}\left\{{ }^n P_{r+1}-{ }^{(n-1)} P_{r+1}\right\}$ is equal to
In how many ways 4 balls can be picked from 6 black and 4 green coloured balls such that at least one black ball is selected?
In how many ways can 9 examination papers be arranged so, that the best and the worst papers are never together?
If a person has 3 coins of different denominations, the number of different sums can be formed is
There are 7 identical white balls and 3 identical black balls. The number of distinguishable arrangements in a row of all the balls, so that no two black balls are adjacent is
The number of ways of distributing eight identical rings to three different girls so that every girl gets at least one ring is
If the letters of the word REGULATIONS be arranged in such a way that relative positions of the letters of the word GULATIONS remain the same, then the probability that there are exactly 4 letters between R and E is
The maximum number of points of intersection of 10 circles is :
Explanation:
Vowels $ \to $ EE
Total No of words = ${{6!} \over {2!2!}}$ = 180
Total no of words if vowels are together
= ${{5!} \over {2!}}$ = 60
$ \therefore $ Total no of words where
vowels never come together = 180 – 60 = 120.
Explanation:
$P = {2 \over 6} = {1 \over 3}$
$ \therefore $ $q = 1 - {1 \over 3} = {2 \over 3}$ (not showing 3 or 5)
Experiment is performed with 4 dices independently
$ \therefore $ Their binomial distribution is
${(q + p)^4} = {(q)^4} + {}^4{C_1}{q^3}p + {}^4{C_2}{q^2}{p^2} + {}^4{C_3}q{p^3} + {}^4{C_4}{P^4}$
$ \therefore $ In one throw of each dice probability of showing 3 or 5 at least twice is
= ${p^4} + {}^4{C_3}q{p^3} + {}^4{C_2}{q^2}{p^2}$
$ = {{33} \over {81}}$
Given such experiment performed 27 times
$ \therefore $ So expected outcomes = np
= ${{33} \over {81}} \times 27$
= 11
Explanation:
1. Two S letters
2. Two L letters
3. One Y letter
4. One A letter
5. One B letter
6. One U letter
Number of ways we can select two alike letters = 2C1
Then number of ways we can select two distinct letters = 5C2
Then total arrangement of selected letters = ${{4!} \over {2!}}$
So total number of words, with or without meaning, that can be formed
= 2C1 $ \times $ 5C2 $ \times $ ${{4!} \over {2!}}$ = 240
Explanation:
Answering right option for each question is possible in 1 way.
So ways of choosing right option for 4 questions = 1.1.1.1 = (1)4
Number of ways of choosing wrong option for each question = 3
So ways of choosing wrong option for 2 questions = (3)2
$ \therefore $ Required number of ways = 6C4.(1)4.(3)2 = 135
Explanation:
Given that sum of digits = 10
$ \therefore $ x + y + z = 10 ......(1)
Also x can't be 0 as if x = 0 then it will become 2 digits number.
So, x $ \ge $ 1, y $ \ge $ 0, z $ \ge $ 0
As x $ \ge $ 1
$ \Rightarrow $ x $-$ 1 $ \ge $ 0
Let x $-$ 1 = t
$ \therefore $ t $ \ge $ 0
From equation (1)
(x $-$ 1) + y + z = 9
$ \Rightarrow $ t + y + z = 9
Now this problem becomes, distributing 9 things among 3 people t, y, z.
Number of ways we can do that
= ${}^{9 + 3 - 1}{C_{3 - 1}} = {}^{11}{C_2} = 55$
Now when 3 digit number is 900 then t = 9, y = 0, z = 0.
And when t = 9, then
x $-$ 1 = 9
$ \Rightarrow $ x = 10
But we can't take x = 10 in a 3 digits number. So, we have to remove this case.
$ \therefore $ Total number of 3 digit numbers = 55 $-$ 1 = 54.
Explanation:




Explanation:
To form four letter words
Case 1 : All same ( not possible)
Case 2 : 1 different, 3 same (not possible)
Case 3 : 2 different, 2 same
= 3C1 $ \times $ 7C2 $ \times $ ${{4!} \over {2!}}$ = 756
Case 4 : 2 same of one kind, 2 same same of other kind
= 3C2 $ \times $ ${{4!} \over {2!2!}}$ = 18
Case 5 : All letters are different
= 8C4 $ \times $ 4! = 1680
$ \therefore $ Total ways = 1680 + 756 + 18 = 2454
Explanation:
No of ways 4 marbels can be chosen where atmost 3 red marbels can be present.
Case 1: When 3 red marbels present
No of ways = 5C3 $ \times $ 7C1
Case 2: When 2 red marbels present
No of ways = 5C2 $ \times $ 7C2
Case 3: When 1 red marbels present
No of ways = 5C1 $ \times $ 7C3
Case 4: When 0 red marbels present
No of ways = 5C0 $ \times $ 7C4
$ \therefore $ Total number of ways
= 5C3 $ \times $ 7C1 + 5C2 $ \times $ 7C2 + 5C1 $ \times $ 7C3 + 5C0 $ \times $ 7C4
= 70 + 210 + 175 + 35
= 490
+ (1! – 2! + 3! – ..... up to 51th term) is equal to :
6.35Cr = (k2 - 3). 36Cr + 1, where k is an integer, is :
Explanation:
$ \therefore $ x1 + x2 + x3 + x4 + x5 = 11
where x1, x5 $ \ge $ 0 and x2, x3, x4 $ \ge $ 1 according to the requirement of the question.
Now, let x2 = a + 1, x3 = b + 1 and x4 = c + 1 where a, b, c $ \ge $ 0
$ \therefore $ New equation will be
x1 + a + b + c + x5 = 8
Now, the number of all possible ways in which the engineer can made visits is equals to the non-negative integral solution of equation
x1 + a + b + c + x5 = 8, and it is equal to
${}^{8 + 5 - 1}{C_{5 - 1}} = {}^{12}{C_4} = {{12 \times 11 \times 10 \times 9} \over {4 \times 3 \times 2}} = 495$
Explanation:
$ \therefore $ So the number of required ways is equal to number of ways to distribute the 6 distinct objects in group sizes 1, 1, 2 and 2
= $\eqalign{ & {{6!} \over {{{(2!)}^2}{{(1!)}^2}(2!)(2!)}}(4!) \cr & = 360 \times 3 = 1080 \cr} $
For $n=1,2,3, \ldots .50$, let
$ A=\left\{a_n / a_n=\left\{\begin{array}{ll} (-1)^{\frac{n}{2}}\left(\frac{n}{2}\right), & \text { if } n \text { is even } \\ (-1)^{\frac{n-1}{2}}\left(\frac{n-1}{2}\right), & \text { if } n \text { is odd } \end{array}\right\}\right\} $
and $B$ is the set of all distinct elements of $A$. The number of permutations all the elements of set $B$ such that even integers are in increasing order, is
$\frac{26!}{12!}$
$\frac{49!}{12!13!}$
$\frac{50!}{24!26!}$
$\frac{26!}{13!12!}$
If $\alpha$ represents the number of arrangements of $p$ men and $q$ women in a row such that all men are together and $\beta$ represents the number of circular arrangements of the same people with the same condition, then $\alpha: \beta$ is
$(q+1) p!: 1$
$(q+1): 1$
$1: p$ !
$p!: q!$
Consider the following statements:
I. The number of positive integral solutions of $x_1+x_2+x_3+x_4=10$ is 286 .
II. If $25!=10^n \times k,(k \in \mathbf{N})$, then $n=6$
Which one of the following options is true?
Only I is true
Only II is true
Both I and II are true
Both I and II are false
A student is allowed to select at least $(n+1)$ books but not all books from a collection of ( $2 n+1$ ) books. If the total number of ways in which he can select these books is 255 , then the number of books in that collection is
4
9
10
7
If $x$ and $y$ represent the number of arrangements of the letters of word ATRAPATRAM such that (i) all A's are together and (ii) no two A's are together respectively, then $x+y$
$\frac{10!}{4!2!2!}$
$\frac{7!\times 15}{2!2!4!}$
$\frac{6!}{2!2!} \times 42$
$\frac{7!}{2!2!}+\frac{6!\cdot 7 p_4}{2!2!}$
Numbers between 1 and 10,000 are formed using the digits 2 and 3 only once and the digit 4 twice. If the numbers thus formed are arranged in increasing order and $x, y$ represent the ranks of 4324 and 324 respectively then $x-y=$
17
31
14
16
The total number of three digit and five digit integers which can be formed by using the digits $0,1,2,3,4,5$ but using each digit not more than once in each number is
100
600
700
800
At an election a voter may vote for any number of candidates not exceeding the number to be elected. If 4 candidates are to be elected out of the 12 contested in the election and voter votes for at least one candidate, then the number of ways in which a voter can vote is
793
298
781
1585
The number of numbers divisible by 3 that can be formed by four different even digits is
How many three digit number satisfy the property that the middle digit is arithmetic mean of the first and the last digit.
If 4 dice are rolled, then the number of ways of getting the sum 10 is



Any two non-adjacent pillers are joined by beams




