记录一些 trivial 组合数学相关

1.Sperner Theorem
设$\mathscr A$为n元集，$\mathscr A_1,\mathscr A_2,...,\mathscr A_m$为$\mathscr A$的子集且两两互不包含，则m的最大值为$\binom{n}{[n/2]}$
proof:
lemma: $\sum_{i=1}^m \frac{1}{\binom{n}{|\mathscr A_i|}} \le1$
proof of lemma:
It is equivalent to $\sum_{i=1}^m|\mathscr A_i|!(n-|\mathscr A_i|)!\le n!$
On the one hand, $\mathscr A$中全排列有$n!$个
On the other hand, for each$\mathscr A_i$，做$\mathscr A$中全排列如下：
$x_1x_2...x_{|\mathscr A_i|}y_1y_2...y_{n-|\mathscr A_i|}$
其中$x_1x_2...x_{|\mathscr A_i|}$是$\mathscr A_i$中元素的全排列。
$y_1y_2...y_{n-|\mathscr A_i|}$是补集的全排列。
注意到，当$i\neq j$时，对应的全排列不同。（否则两个子集有包含关系）

由lemma： $\frac{m}{\binom{n}{[n/2]}}\le \sum_{i=1}^m\frac{1}{\binom{n}{\mathscr |A_i|}}\le 1$，得证。

2.Kummer Theorem
$n=(n_kn_{k-1}...n_0)_p$
$m=(m_km_{k-1}...m_0)_p$
$n-m=(d_kd_{k-1}...d_0)_p$
$v_p(\binom{n}{m})$ equals to the aomunt of carry-bit: L
when adding (n-m) and m.
proof:
$v_p(n!)=\sum_{l=1}^\infty[\frac{n}{p^l}]=n_1+n_2(1+p)+...+n_k(1+p^2+...+p^{k-1})=\frac{n-(n_0+n_1+...+n_k)}{p-1}$
Thus $v_p(\binom{n}{m})=v_p(n!)-v_p((n-m)!)-v_p(m!)=\frac{\sum_{i=0}^k(m_i+d_i-n_i)}{p-1}=L$

一个有趣的结论：$lcm(\binom{n}{0},\binom{n}{1},...,\binom{n}{n})=\frac{lcm(1,2,...,n+1)}{n+1}$
src: https://arxiv.org/pdf/0906.2295v2.pdf

3.Lucas Theorem
$n=(n_kn_{k-1}...n_0)_p$
$m=(m_km_{k-1}...m_0)_p$
$\binom{n}{m}\equiv \prod_{i=0}^k\binom{n_i}{m_i} (mod p)$
proof:
算两次，首先考察$(1+x)^n$，$x^m$系数为$\binom{n}{m}=LHS$.
然后，$(1+x)^n=(1+x)^{\sum_{j=0}^{j=k}n_jp^j}\equiv \prod _{j=0}^{j=k}(1+x^{p^j})^{n_j}$
$RHS=[x^m]\prod _{j=0}^{j=k}(1+x^{p^j})^{n_j}$