• edited by
4,771 views
14 14 votes

The number of permutation of $\{1,2,3,4,5\}$ that keep at least one integer fixed is.

  1. $81$
  2. $76$
  3. $120$
  4. $60$

5 Answers

Best answer
14 14 votes

It is based on inclusion exclusion principle:

Total arrangements - derangements 

$\begin{align}&=5!-[5!-^5C_1(4!)+^5C_2(3!)-^5C_3(2!)+^5C_4(1!)-^5C_5(0!)]\\&=^5C_1(4!) - ^5C_2(3!) + ^5C_3(2!) -^5C_4(1!) +^5C_5(0!)\\&=120 - 60 + 20 - 5 + 1\\ &= 76.\end{align}$ 

Correct Answer: $B$

• edited by
1 1 vote

Here many people is mis understand this question so that they get 120 as answer which is wrong. So we first understand the question.

Given that ATLEAST ONE INTEGER FIXED, which means you can take any permutation and in that permutation atleast one integer is on its actual place and others are not.

EG:  12345 is given so possible permutation with one integer(1) is fixed 13245, 14523, 15432 etc... now one integer(2) is fixed 32154, 42153, 52134 etc...likewise only one integer is fixed

Now two integer(12) is fixed 12534, 12453 etc... likewise we have to fix 3 and 5 integer also, Here keep in mind that we can't make any permutation with fixing 4 integers coz in that case last integer has to fit in actual place coz no dearrangement is possible.   

Here all the permutations in which every integer is dearrange is not included in our answer.

so our answer is 5!-D5=76        where D5 is dearrangement of 5 integer.                                                               

1 1 vote

Correct Option: (B) 76

Let, $S = \left \{ 1, 2, 3, 4, 5 \right \}$,

$S_1, S_2, S_3, S_4, S_5$ be the the five integers,

$|S_i|$ where $i \in S$ mean that integer $S_i$ is fixed .

Now, we want to find the no. of permutations in which at least 1 integer is fixed.

In other words, we want to find $|S_1 \cup  S_2 \cup S_3 \cup S_4 \cup S_4 \cup S_5|$.

Now, according to the Principle of Arrangement and De-arrangement, we have

 

$|S_1 \cup  S_2 \cup S_3 \cup S_4 \cup S_4 \cup S_5| = \sum_{i \in S}|S_i| - \sum_{i, j \in S \ \land \  i \neq j}|S_i \cap S_j| + \\ \sum_{i, j, k \in S \ \land \ i \neq j \neq k}|S_i \cap S_j \cap S_k| - \sum_{i, j, k, l \in S \ \land \ i \neq j \neq k \neq l}|S_i \cap S_j \cap S_k \cap S_l| + \\ \sum_{(i, j, k, l, m \in S \ \land \ i \neq j \neq k \neq l \neq m}|S_i \cap S_j \cap S_k \cap S_l \cap S_m|$

 

Now,

$\sum_{i \in S}|S_i| = \binom{5}{1} \times 4! = 120$

$\sum_{i, j \in S \ \land \  i \neq j}|S_i \cap S_j| =  \binom{5}{2} \times 3! = 60$

$\sum_{i, j, k \in S \ \land \ i \neq j \neq k}|S_i \cap S_j \cap S_k| = \binom{5}{3} \times 2! = 20$

$\sum_{i, j, k, l \in S \ \land \ i \neq j \neq k \neq l}|S_i \cap S_j \cap S_k \cap S_l| = \binom{5}{4} \times 1! = 5$

$\sum_{(i, j, k, l, m \in S \ \land \ i \neq j \neq k \neq l \neq m}|S_i \cap S_j \cap S_k \cap S_l \cap S_m| = \binom{5}{5} = 1$

 

$\therefore$ We finally have,

$|S_1 \cup  S_2 \cup S_3 \cup S_4 \cup S_4 \cup S_5| = 120 - 60 + 20 - 5 +1 = 76$

 

 

0 0 votes

Derangement means no elements should appear in its original position so derangement of 5 means all 5 elements do not appear on its original position.

So if we subtract D5 from total ways we shall get numbers in which at least one element is fixed because we already subtracted those elements where all 5 elements do not appear on same position hence only that elements are remaining where at least one element is fixed in its original position.

Total ways = 5!
D5(derangement of 5) = 44 (apply formula)
 Desired output:     5!-44 = 76

Hence correct answer is option B

 

 

–1 –1 vote

Answer C

There are five places

                                         __  __  __  __  __ 

And we are given five integers {1, 2, 3, 4, 5}


And we are supposed to fix one integer

  • Let me fix integer $1$ at position 1

                                        1  __  __  __  __ 


Now at other four places I can keep the any integers, other than the one already used i.e. 1

So, at second position {2, 3, 4, 5} any one can be kept. There are total $4$ possible options

  • Let me keep $2$

Now, at third position {3, 4, 5} any one can be kept
There are total $3$ possible options

  • Let me keep $3$

So, at fourth position {4, 5} any one can be kept
There are total $2$ possible options

  • Let me keep $4$

Now can fifth position only {5} can be kept as that is the only one left
There is only $1$ possible option

So, overall, when I keep $1$ fixed on position 1 there are total $4*3*2*1$ which is $24$ possible options

Instead of keeping $1$, I can keep any of {1, 2, 3, 4, 5} integers. So there are total $5$ options when it comes to keeping a number on position 1

And with each number which I keep on position 1, there are $24$ possible options of placing other integers at other places

So, in all, there are $5*24$ which is $120$ possibilities

Position:
Show:

Related questions

19 19 votes
4 answers 4 answers
3.9k
3.9k views
Tesla! asked Apr 3, 2017
3,918 views
A subset $S$ of set of numbers $\{2,3,4,5,6,7,8,9,10\}$ is said to be good if has exactly $4$ elements and their $gcd=1$, Then number of good subset is$126$$125$$123$$121...
21 21 votes
5 answers 5 answers
4.7k
4.7k views
Tesla! asked Apr 3, 2017
4,744 views
In how many ways can three person, each throwing a single die once, make a score of $11$$22$$27$$24$$38$
14 14 votes
3 answers 3 answers
3.8k
3.8k views
Tesla! asked Apr 3, 2017
3,818 views
A club with $x$ members is organized into four committees such that each member is in exactly two committees,any two committees have exactly one member in common .Then $x...
3 3 votes
2 2 answers
1.3k
1.3k views
Tesla! asked Apr 5, 2017
1,281 views
Let $X$ be a nonempty set and let $\mathcal{P}(X)$ denote the collection of all subsets of $X.$ Define $\textit{f}:\textit{X$\times$ $\mathcal{P}$(X)}\rightarrow \mathbb{...