小马的世界

【离散数学】笔记-台湾清华赵启超11A11B Enumeration

2021-07-31 · 4 min read
离散数学 数学

这是台湾清华赵启超教授离散数学11A11B课程的笔记。

11AB Enumeration

Proof
We will show that every element xx of the union makes a net contribution of 1 to the right-hand side suppose xx belongs to precisely r,1rnr, 1\le r \le n of the sets A1,A2,,AnA_1, A_2, \dotsc, A_n.

α1=A1+A2++An\alpha _1=|A_1|+|A_2|+\dotsc +|A_n|

xx contributes rr to α1\alpha _1
α2\alpha _2, xx contributes 1 to AiAj|A_i \cap A_j|, when both AiA_i and AjA_j are among the rr sets which contain xx. There are (r2)\begin{pmatrix} r \\ 2\end{pmatrix} such pairs, and so (r2)\begin{pmatrix} r \\ 2\end{pmatrix} is the contribution of xx to α2\alpha _2.
In general, the contribution of xx to αi,1ir\alpha _i, 1\le i \le r is (ri)\begin{pmatrix} r \\ i\end{pmatrix}.
If i>ri>r, the contribution of xx to αi\alpha _i is 0.
Hence the net contribution of xx to the right-hand side is (r1)(r2)++(1)i1(ri)++(1)r1(rr)=(r0)\begin{pmatrix} r \\ 1\end{pmatrix}-\begin{pmatrix} r \\ 2\end{pmatrix}+\dotsc +(-1)^{i-1}\begin{pmatrix} r \\ i\end{pmatrix}+\dotsc +(-1)^{r-1}\begin{pmatrix} r \\ r\end{pmatrix}=\begin{pmatrix} r \\ 0\end{pmatrix}

since (r0)(r1)+(r2)++(1)r(rr)=0\begin{pmatrix} r \\ 0\end{pmatrix}-\begin{pmatrix} r \\ 1\end{pmatrix}+\begin{pmatrix} r \\ 2\end{pmatrix}+\dotsc +(-1)^{r}\begin{pmatrix} r \\ r\end{pmatrix}=0

Example 1
Let Φ(n)\Phi(n) denote the number of integers mm in the range 1mn1\le m \le n such that mm and nn are relatively prime, i.e., gcd(m,n)=1gcd(m,n)=1
Φ(n)\Phi(n) is Euler's Phi Function or Euler's Totient Function

Φ(n)={m:1mn,gcd(m,n)=1}\Phi(n)=|\{m:1\le m\le n,gcd(m,n)=1\}|

n Φ(n)\Phi(n)
1 {1}\{1\} 1
2 {1,2}\{1,2\} 1
3 {1,2,3}\{1,2,3\} 2
4 {1,2,3,4}\{1,2,3,4\} 2
5 {1,2,3,4,5}\{1,2,3,4,5\} 4
6 {1,2,3,4,5,6}\{1,2,3,4,5,6\} 2

Φ(p)=p1\Phi(p)=p-1 if pp is a prime.
Find Φ(60)\Phi(60)
We have 60=22×3×560=2^2\times 3\times 5