Introductory Combinatorics
内容简介
Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This trusted best-seller covers the key combinatorial ideas--including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises.
......(更多)
作者简介
......(更多)
目录
......(更多)
读书文摘
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)!
For n and r positive integers with r <= n, P(n, r)=n*(n-1)* ……*(n-r-1)=n!/(n-r)!
......(更多)
