Loading [MathJax]/jax/output/SVG/jax.js
 
  Questions   
Sort: 
Apr 17, 2025
Apr 16, 2025
Apr 15, 2025
Apr 13, 2025
Apr 12, 2025
Apr 10, 2025
 #1
avatar+46 
0

Let S be the set of all permutations of (1,2,3,4,5,6,7). The total number of such permutations is ∣S∣=7!

 

We are interested in the number of permutations that have at least one even fixed point. The even numbers in the set {1,2,3,4,5,6,7} are {2,4,6}.

 

Let Ai​ be the set of permutations where i is a fixed point. We want to find the number of permutations in A2​∪A4​∪A6​.

 

Using the Principle of Inclusion-Exclusion, we have:

 

∣A2​∪A4​∪A6​∣=∣A2​∣+∣A4​∣+∣A6​∣−(∣A2​∩A4​∣+∣A2​∩A6​∣+∣A4​∩A6​∣)+∣A2​∩A4​∩A6​∣

 

We calculate the size of each intersection:

 

\begin{enumerate}

 

\item ∣Ai​∣: If i is a fixed point, then the remaining n−1 elements can be permuted in (n−1)! ways. For n=7:

 

∣A2​∣=(7−1)!=6!=720

 

∣A4​∣=(7−1)!=6!=720

 

∣A6​∣=(7−1)!=6!=720

 

\item ∣Ai​∩Aj​∣: If i and j are fixed points, then the remaining n−2 elements can be permuted in (n−2)! ways. For n=7:

 

∣A2​∩A4​∣=(7−2)!=5!=120

 

∣A2​∩A6​∣=(7−2)!=5!=120

 

∣A4​∩A6​∣=(7−2)!=5!=120

 

\item ∣A2​∩A4​∩A6​∣: If 2,4, and 6 are fixed points, then the remaining n−3 elements can be permuted in (n−3)! ways. For n=7:

 

∣A2​∩A4​∩A6​∣=(7−3)!=4!=24

 

\end{enumerate}

 

Now, substitute these values into the Inclusion-Exclusion Principle formula:

 

∣A2​∪A4​∪A6​∣=720+720+720−(120+120+120)+24

 

∣A2​∪A4​∪A6​∣=2160−360+24

 

∣A2​∪A4​∪A6​∣=1800+24

 

∣A2​∪A4​∪A6​∣=1824

 

Thus, there are 1824 permutations of (1,2,3,4,5,6,7) that have at least one even fixed point.

 

Final Answer: The final answer is 1824​

Apr 10, 2025
Apr 9, 2025

1 Online Users