摘要：
Let S be a set of $n$ objects; then the binomial coefficient $(^n_k)$ is the number of $k$-elements subsets of $S$. Thus $\sum_{k=0}^n(^n_k)$ is the n 阅读全文
posted @ 2018-02-10 02:00
孤注一掷
阅读(161)
评论(0)
推荐(0)
|
摘要：
Let S be a set of $n$ objects; then the binomial coefficient $(^n_k)$ is the number of $k$-elements subsets of $S$. Thus $\sum_{k=0}^n(^n_k)$ is the n 阅读全文
posted @ 2018-02-10 02:00
孤注一掷
阅读(161)
评论(0)
推荐(0)
摘要：
The power set of a set A is the collection of all subsets of A. When working with a finite set with n elements, one question that we might ask is, “Ho 阅读全文
posted @ 2018-02-10 00:59
孤注一掷
阅读(269)
评论(0)
推荐(0)
|
浙公网安备 33010602011771号