recategorized by
555 views
1 votes
1 votes

The number of permutations of the letters $a, b, c$ and $d$ such that $b$ does not follow $a,c$ does not follow $b$, and $c$ does not follow $d$, is

  1. $11$
  2. $12$
  3. $13$
  4. $14$
recategorized by

1 Answer

Best answer
3 votes
3 votes

$\mathbf{\underline{Answer: A}}$

$\underline{\mathbf{Explanation:}}$

Total number of permutations of $\color{darkorange}{\mathbf{a, b, c, d}} = 4!= 24 $

Number of permutations of $\color{blue}{\mathbf{ab, c, d} }= 3!= 6 $
Number of permutations of $\color{blue}{\mathbf{a, bc, d}} = 3!= 6 $
Number of permutations of $\color{blue}{\mathbf{a ,b ,cd} }= 3!= 6 $

Number of permutations of $\color{green}{\mathbf b} \;\text{and}\; \color{green}{\mathbf c} = 2!= 2 $
Number of permutations of $\color{green}{\mathbf c} \;\text{and} \;\color{green}{\mathbf d} = 2!= 2 $
Number of permutations of $ \color{green}{\mathbf d} \;\text{and} \;\color{green}{\mathbf b}= 2! =2 $

Number of permutations of $ \color{green}{\mathbf{b,c}} \;\text{and} \; \color{green}{\mathbf d} = 1! = 1 $

Hence, required permutations are:

$\mathbf{4! - 3! - 3! - 3! + 2! + 2! + 2! - 1! = \underline{11}}$
 
$\therefore $ Option $\mathbf A$ is the correct answer.
edited by

Related questions

2 votes
2 votes
2 answers
1
2 votes
2 votes
3 answers
2
Arjun asked Sep 23, 2019
729 views
$^nC_0+2^nC_1+3^nC_2+\cdots+(n+1)^nC_n$ equals$2^n+n2^{n-1}$$2^n-n2^{n-1}$$2^n$none of these
2 votes
2 votes
1 answer
3
Arjun asked Sep 23, 2019
896 views
Consider $30$ multiple-choice questions, each with four options of which exactly one is correct. Then the number of ways one can get only the alternate questions correctl...