《组合数学》的原文摘录

For n and r positive integers with r <= n, P(n, r)=n*(n-1)* ……*(n-r-1)=n!/(n-r)! (查看原文)

ClarenceAu 1赞 2011-02-11 09:07:23

—— 引自第35页
The number of circular r-permutations of a set of n elements is given by P(n,r)/r=n!/r(n-r)! In particular, the number of circular permutations of n elements is (n-1)! (查看原文)

ClarenceAu 1赞 2011-02-11 09:07:23

—— 引自第35页
For 0 <= r <= n, P(n,r) = r!C(n,r) Hence C(n,r) = n!/r!(n-r)! (查看原文)

ClarenceAu 1赞 2011-02-11 09:07:23

—— 引自第35页
For 0 <= r <= n, C(n,r)=C(n, n-r) (查看原文)

ClarenceAu 1赞 2011-02-11 09:07:23

—— 引自第35页
For all integers n and k with 1 <= k <= n, C(n,k) = C(n-1,k) + C(n-1,k-1) (查看原文)

ClarenceAu 1赞 2011-02-11 09:07:23

—— 引自第35页
For n >= 0 C(n,0)+C(n,1)+C(n,2)+...+C(n,n)=2^n, and the common value equals the number of subsets of an n-element set. (查看原文)

ClarenceAu 1赞 2011-02-11 09:07:23

—— 引自第35页

作者: 布鲁迪
isbn: 711115360X
书名: 组合数学
页数: 425
译者: 冯舜玺
定价: 45.00元
出版社: 机械工业出版社
装帧: 简裝本
出版年: 2005-2