CSCA67H3 Lecture 1: Permutation and Combination
whitewalnut0803 and 38507 others unlocked
6
CSCA67H3 Full Course Notes
Verified Note
6 documents
Document Summary
Adapted from: bretscher, csca67 week 1 lecture notes, Consider a pizza commercial that advertises: 2 pizzas, up to 5 toppings on each, 11 toppings to choose from. # of combinations of up to 5 toppings = # of combinations of no toppings + # of combinations of 1 topping + . # of combinations of 4 toppings + # of combinations of 5 toppings: there is only 1 way to combine no toppings. # of combinations of no toppings = 1: there are 11 choices of toppings, meaning that there are 11 ways to combine a single topping. # of combinations of 1 topping = 11: there are 11 di erent ways to choose a single topping. This means that there are 11 10 ways to choose 2 toppings. However, some of the combinations of 2 toppings are equivalent, since the order in which the toppings are selected does not matter. (cid:124) (cid:123)(cid:122)