← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

C 附录C 计数与概率

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.794Z

ways to choose 0 elements from an n-set is 1 (not 0), since 0! = 1. Binomial coefficients

The notation (read “n choose k”) denotes the number of k-combinations of an n-set. Equation (C.2) gives This formula is symmetric in k and n − k: These numbers are also known as

binomial coefficients, due to their appearance in the binomial theorem: where n ∈ ℕ and x

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea