Hello canyiahI think this should be .

The problem is equivalent to choosing items from , with repetition being allowed. The items are the votes, each for a particular candidate or none; the are the candidates plus a 'null' vote, where the vote is not cast for any of the candidates.

Now the number of ways of choosing items from , with repetition allowed, is:(See here, for example.)So when and , this is:

Since repetition is not allowed in the choice of meat, I'm assuming that it is not allowed in the choice of additional topping either. I'm also assuming that you must choose exactly 1 pasta, 1 sauce and 1 salad, but that you can choose 0 meats and 0 additional toppings (since the phrases 'as many as you want' and 'up to' are used for these items).2) how many different dinners can be created if

4 choices of pasta(only can choose 1), 5 choices of sauces(only can choose 1),2 choices of salads(only can choose 1), 4 choices of meats(can choose as many as you want assume they are different ie meat meat isnt allowed), 5 additional toppings(choose up to 3)

Then we have:

Number of choices of pasta:So, if my assumptions are correct, I reckon the number of different dinners is:

Number of choices of sauce:

Number of choices of salad:

Number of choices of meat: , since each of the meats may be either chosen or rejected

Number of choices of additional topping:

Grandad