If there are n₁ of type 1, n₂ of type 2, and so on, for r

Last updated: 7/15/2022

If there are n₁ of type 1, n₂ of type 2, and so on, for r different types, then the number of distinguishable permutations is calculated using the following formula. A shelf stocker at a local grocery store has 2 varieties of brand A frozen dinners, 2 varieties of brand B frozen dinners, and 4 varieties of brand C frozen dinners. Complete parts (a) through (c) below. (a) In how many distinguishable ways can she stock the shelves if the dinners can be arranged in any order?