《离散数学》杨争锋ch4-5.ppt

§4.5 Generalized Permutations and Combinations (一般性的排列与组合) Introduction See page 325. 2. Permutations with Repetition (有重复的排列) (1) Example 1 (page 325) How many strings of length n can be formed from the English alphabet? Solution: 26n (2) Theorem 1 (page 325) The number of r-permutations of a set of n objects with repetition allowed is nr. Proof: 当允许重复时，在r-排列中对r-个位置中的每个位置有n种方式选择集合的元素，因为对每个选择，所有n个物体都是有效的。因此，由乘法规则，当允许重复时存在nr 个r-排列。 3. Combinations with Repetition（有重复的组合） (1) Example 2 (page 336) How many ways are there to select four pieces of fruit from a bowl containing apples, oranges, and pears if the order in which the pieces are selected does not matter, only the type of fruit and not the individual pieces matters, and there are at least four pieces of each type of fruit in the bowl. Solution: 15 ways: 4 apples 4 oranges 4 pears 3 apples, 1 oranges 3 pears, 1 pear 3 oranges, 1 apple 3 oranges, 1 pear 3 pears, 1 apple 3 pears, 1 orange 2 apples, 2 oranges 2 apples, 2 pears 2 oranges, 2 pears 2 apples, 1 orange, 1 pear 2 oranges, 1 apple, 1 pear 2 pears, 1 apple, 1 orangle This solution is the number of 4-combinations with repetition allowed from a three-element set {apple, orange, pear} (2) Example 3 (page 326) How many ways are there to select five bills from a cashbox containing $1 bills, $2 bills, $5 bills, $10 bills, $20 bills, $50 bills, and $100 bills? Assume that the order in which the bills are chosen does not matter, that the bills of each denomination are indistinguishable (同种币值的纸币是不加区分的), and that there are at least five bills of each type. Solution: 要点如下（page 336~337） 用6 | 　和　5 *来描述，　例如： 　(1) | | | * * | | | * * *表示2 $10s, 3 $1s (2) * | * | * * | | * | | 表示 1 $100, 1 $50, 2 $20s, 1 $5 (3) * | | | * * | | * | *