![]() ![]() How many combinations are possible if customers are also allowed replacements when choosing toppings? For meats and cheeses this is now aĬombinations replacement or multichoose problem using the combinations with replacements equation:Ĭ R(n,r) = C(n+r-1, r) = (n+r-1)! / (r! (n - 1)!)įor meats, where the number of objects n = 5 and the number of choices r = 3, we can calculate eitherĬ R(5,3) = 35 or substitute terms and calculate combinations C(n+r-1, r) = C(5+3-1, 3) =Ĭalculating cheese choices in the same way, we now have the total number of possible options for each category atĪnd finally we multiply to find the total Now replacements are allowed, customers can choose any item more than once when they select their portions. In the previous calculation, replacements were not allowed customers had to choose 3 different meats and 2 different cheeses. 2 portions of one meat and 1 portion of another?.How many possible combinations are there if your customers are allowed to choose options like the following that still stay within the limits of the total number of portions allowed: ![]() Multiplying the possible combinations for each category we calculate:
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |