这是台湾清华赵启超教授离散数学11A11B课程的笔记。
11AB Enumeration
Proof
We will show that every element x of the union makes a net contribution of 1 to the right-hand side suppose x belongs to precisely r,1≤r≤n of the sets A1,A2,…,An.
α1=∣A1∣+∣A2∣+…+∣An∣
x contributes r to α1
α2, x contributes 1 to ∣Ai∩Aj∣, when both Ai and Aj are among the r sets which contain x. There are (r2) such pairs, and so (r2) is the contribution of x to α2.
In general, the contribution of x to αi,1≤i≤r is (ri).
If i>r, the contribution of x to αi is 0.
Hence the net contribution of x to the right-hand side is (r1)−(r2)+…+(−1)i−1(ri)+…+(−1)r−1(rr)=(r0)
since (r0)−(r1)+(r2)+…+(−1)r(rr)=0
Example 1
Let Φ(n) denote the number of integers m in the range 1≤m≤n such that m and n are relatively prime, i.e., gcd(m,n)=1
Φ(n) is Euler's Phi Function or Euler's Totient Function
Φ(n)=∣{m:1≤m≤n,gcd(m,n)=1}∣
| n |
|
Φ(n) |
| 1 |
{1} |
1 |
| 2 |
{1,2} |
1 |
| 3 |
{1,2,3} |
2 |
| 4 |
{1,2,3,4} |
2 |
| 5 |
{1,2,3,4,5} |
4 |
| 6 |
{1,2,3,4,5,6} |
2 |
Φ(p)=p−1 if p is a prime.
Find Φ(60)
We have 60=22×3×5