MHB How can I find |A|,having found |UA_{i}^{c}| ?

  • Thread starter Thread starter evinda
  • Start date Start date
Click For Summary
The discussion focuses on finding the size of the set A, which consists of permutations in S_n where no element appears in its original position, known as derangements. The user calculates |A_i| and establishes that |A| can be derived from the total permutations |S_n| minus the size of the complement set |A^c|. The formula for |A| is confirmed to be n! times the sum of (-1)^k/k! from k=0 to n. The conversation concludes with an acknowledgment of understanding the concept of derangements.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! :)
I am looking at an exercise,that asks me to find $|A|$,where $A=\{\sigma \in S_{n}:\sigma(i) \neq i \forall i=1,...,n \}$
I found that $|A_{1}|=\{ \sigma \in S_{n}:\sigma(1) \neq 1 \} |=(n-1)!(n-1) $ ,from which we get that : $|A_{i}|=\{ \sigma \in S_{n}:\sigma(i) \neq i \} |=(n-1)!(n-1) $

$A=\bigcap_{i \in[n]} A_{i}$ and $A^{c}=U A_{i}^{c}$

$$|U A_{i}^{c}|=\sum_{k=1}^{n}(-1)^{k-1}\sum_{J \subseteq [n],|J|=k}|\bigcap_{i \in J} A_{i}^{c}|=n!(1-\frac{1}{e})+n!R(n) ,\text{ where } R(n)=\frac{1}{e}-\sum_{k=0}^{n}\frac{(-1)^{k}}{k!}$$

But,how can I find $|A|$ ?
 
Physics news on Phys.org
Obviously, $|A|=|S_n|-|A^c|$.
 
Evgeny.Makarov said:
Obviously, $|A|=|S_n|-|A^c|$.

So,is it $n!-n!(1-\frac{1}{e})-n!R(n) =n!(\frac{1}{e}-R(n)$ ?
 
evinda said:
So,is it $n!-n!(1-\frac{1}{e})-n!R(n) =n!(\frac{1}{e}-R(n))$ ?
Yes. Also, $1/e$ that occurs in $R(n)$ can be eliminated to get
\[
|A|=n!\sum_{k=0}^n\frac{(-1)^k}{k!}
\]
By the way, such permulations are called derangements.
 
Evgeny.Makarov said:
Yes. Also, $1/e$ that occurs in $R(n)$ can be eliminated to get
\[
|A|=n!\sum_{k=0}^n\frac{(-1)^k}{k!}
\]
By the way, such permulations are called derangements.

I understand :) Thank you very much!
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K