原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
sion of the left-hand side. A special case of the binomial theorem occurs when x = y = 1:
This formula corresponds to counting the 2n binary n-strings by the number of 1s they contain: binary n-strings contain exactly k 1s, since there are ways to choose k out of the n
positions in which to place the 1s. Many identities involve binomial coefficients. The ex
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea