retagged by
1,189 views

1 Answer

4 votes
4 votes

Answer: $\mathbf B$

Explanation:


The number of integers are $\mathbf n$

Total number of arrangements possible $ = \mathbf n!$

Now, let's bundle  $1$ and $2$ together, then number of arrangements possible $\mathrm{=(n-1)!2!}$ ways.

$\because$ Total elements now are $\color {blue}{\mathrm n-1}$ and one bundle is having $2$ elements which can be arranged in $2!$ ways.

So, favorable cases $\mathrm{=(n-1)!2!}$

So, total cases possible, i.e., sample space $=\mathrm n!$

$\therefore$ Probability $\large{\mathrm{= \frac{(n-1)!2!}{n!} = \frac{(n-1)!2!}{(n-1)!n}=\color {green} {\frac{2}{n} }}}$

$\therefore \mathbf B$ is the correct option.

edited by

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
3 answers
4
Arjun asked Sep 23, 2019
1,355 views
Let $A$ be a set of $n$ elements. The number of ways, we can choose an ordered pair $(B,C)$, where $B,C$ are disjoint subsets of $A$, equals$n^2$$n^3$$2^n$$3^n$