Permutation and Combination MCQ Questions & Answers in Algebra | Maths
Learn Permutation and Combination MCQ questions & answers in Algebra are available for students perparing for IIT-JEE and engineering Enternace exam.
61.
The total number of ways in which six $$' + '$$ and four $$' - '$$ signs can be
arranged in a line such that no two $$' - '$$ signs occur together is
A
$$\frac{{7!}}{{3!}}$$
B
$$6!\, \times \frac{{7!}}{{3!}}$$
C
$$35$$
D
None of these
Answer :
$$35$$
$$' - '$$ signs will be put between two $$' + '$$ signs or at the two ends.
There are $$7$$ places for four $$' - '$$ signs. So, the required number of ways
$$ = {\,^7}{C_4} = \frac{{7!}}{{4!\,3!}}$$
(there being no arrangement as the $$' + '$$ signs are identical as well as $$' - '$$ signs are identical).
62.
In an examination of 9 papers a candidate has to pass in more papers than the number of papers in which he fails in order to be successful. The number of ways in which he can be unsuccessful is
A
255
B
256
C
193
D
319
Answer :
256
The candidate is unsuccessful if he fails in 9 or 8 or 7 or 6 or 5 papers.
∴ the number of ways to be unsuccessful
$$\eqalign{
& = {\,^9}{C_9} + {\,^9}{C_8} + {\,^9}{C_7} + {\,^9}{C_6} + {\,^9}{C_5} \cr
& = {\,^9}{C_0} + {\,^9}{C_1} + {\,^9}{C_2} + {\,^9}{C_3} + {\,^9}{C_4} \cr
& = \frac{1}{2}\left( {^9{C_0} + {\,^9}{C_1} + ..... + {\,^9}{C_9}} \right) = \frac{1}{2} \cdot {2^9} = {2^8}. \cr} $$
63.
There are 10 bags $${B_1},{B_2},{B_3},.....,{B_{10}},$$ which contain 21,22, . . . . . , 30 different articles respectively. The total number of ways to bring out 10 articles from a bag is
64.
If the letters of the word SACHIN are arranged in all possible ways and these words are written out as in dictionary, then the word SACHIN appears at serial number
A
601
B
600
C
603
D
602
Answer :
601
Alphabetical order is
A, C, H, I, N, S
No. of words starting with A - 5!
No. of words starting with C - 5!
No. of words starting with H - 5!
No. of words starting with I - 5!
No. of words starting with N - 5!
SACHIN - 1
∴ sachin appears at serial no 601
65.
The number of distinct rational numbers $$x$$ such that $$0 < x < 1$$ and $$x = \frac{p}{q},$$ where $$p,q \in \left\{ {1,2,3,4,5,6} \right\},$$ is
A
15
B
13
C
12
D
11
Answer :
11
As $$0 < x < 1 ,$$ we have $$p < q$$
The number of rational numbers $$= 5 + 4 + 3 + 2 + 1 = 15.$$
When $$p, q$$ have a common factor, we get some rational numbers which are not different from those already counted. There are 4 such numbers :
$$\frac{2}{4},\frac{2}{6},\frac{3}{6},\frac{4}{6}$$
Therefore, required number of rational numbers $$= 15 - 4 = 11.$$
66.
In a shop there are five types of ice-creams available. A child buys six ice-creams. Statement - 1 : The number of different ways the child can buy the six ice-creams is $$^{10}{C_5}.$$ Statement - 2 : The number of different ways the child can buy the six ice-creams is equal to the number of different ways of arranging $$6\,A’s$$ and $$4\,B’s$$ in a row.
A
Statement - 1 is false, Statement - 2 is true
B
Statement - 1 is true, Statement - 2 is true; Statement - 2 is a correct explanation for Statement - 1
C
Statement - 1 is true, Statement - 2 is true; Statement - 2 is not a correct explanation for Statement - 1
D
Statement - 1 is true, Statement - 2 is false
Answer :
Statement - 1 is false, Statement - 2 is true
The given situation in statement - 1 is equivalent to find the non-negative integral solutions of the equation
$${x_1} + {x_2} + {x_3} + {x_4} + {x_5} = 6$$
which is co-eff. of $${x^6}$$ in the expansion of
$$\eqalign{
& {\left( {1 + x + {x^2} + {x^3} + ......\infty } \right)^5} = {\text{co-eff}}{\text{. of }}{x^6}{\text{ in }}{\left( {1 - x} \right)^{ - 5}} \cr
& = {\text{co-eff}}{\text{. of }}{x^6}{\text{ in}}\,\,1 + 5x + \frac{{5.6}}{{2!}}{x^2}...... \cr
& = \frac{{5.6.7.8.9.10}}{{6!}} = \frac{{10!}}{{6!4!}} = {\,^{10}}{C_6} \cr} $$
∴ Statement - 1 is wrong.
Number of ways of arranging $$6A’s$$ and $$4B’s$$ in a row
$$ = \frac{{10!}}{{6!4!}} = {\,^{10}}{C_6}$$ which is same as the number of ways the child can buy six ice-creams.
∴ Statement - 2 is true.
67.
Let $$A$$ be a set of $$n\left( { \geqslant 3} \right)$$ distinct elements. The number of triplets $$(x, y, z)$$ of the elements of $$A$$ in which at least two coordinates are equal is
A
$$^n{P_3}$$
B
$${n^3}{ - ^n}{P_3}$$
C
$$3{n^2} - 2n$$
D
$$3{n^2}\left( {n - 1} \right)$$
Answer :
$$3{n^2} - 2n$$
Total number of triplets without restriction $$ = n \times n \times n.$$
The number of triplets with all different co-ordinates $$ = {\,^n}{P_3}.$$
∴ the required number of triplets $$ = {n^3} - n\left( {n - 1} \right)\left( {n - 2} \right).$$
68.
If the number of arrangements of $$n - 1$$ things taken from $$n$$ different things is $$k$$ times the number of arrangements of $$n - 1$$ things taken from $$n$$ things in which two things are identical then the value of $$k$$ is
69.
$$'n'$$ is selected from the set $$\left\{ {1,2,3,.....,100} \right\}$$ and the number $$2^n + 3^n + 5^n$$ is formed. Total number of ways of selecting $$'n'$$ so that the formed number is divisible by 4, is equal to
A
50
B
49
C
48
D
None of these
Answer :
49
If $$n$$ is odd, $${3^n} = 4{\lambda _1} - 1,{5^n} = 4{\lambda _2} + 1$$
$$ \Rightarrow {2^n} + {3^n} + {5^n}$$ is not divisible by 4, as $${2^n} + {3^n} + {5^n}$$ will be in the form of $$4\lambda + 2.$$
Thus, total number of ways of selecting $$'n'$$ is equal to 49.
70.
The set $$S = \left\{ {1,2,3,.....,12} \right\}$$ is to be partitioned into three sets $$A, B, C$$ of equal size. Thus $$A \cup B \cup C = S,A \cap B = B \cap C = A \cap C = \phi .$$ The number of ways to partition $$S$$ is