Generating Function for Selecting Candies with Varying Quantities and Types

toothpaste666
Messages
516
Reaction score
20

Homework Statement



given one each of u types of candy, two each of v types of candy, and three each of of w types of candy, find a generating function for the number of ways to select r candies.

The Attempt at a Solution



I am not sure if I understand this correctly, but this is what I came up with

(x^0 + x^1)^u (x^0 + x^1 + x^2)^v (x^0 + x^1 + x^2 + x^3)^w
 
Physics news on Phys.org
What do you mean by a 'generating function'? Is it a probability generating function? If so, what is the random variable to which the function is being related?

If it's not a prob-gen function, then what does the 'x' in the above equation represent?

I'm pretty sure that, whatever the intended meaning of your expression, it won't be the answer, as it doesn't use r.

Regarding the meaning of the question itself, I think it's clear enough. Say the candy is arranged in u+v+w cups in a line in front of you. The first u cups each have one candy in, the next v cups have two each and the last w have three each. The candies in the k-th cup all have the number k written on them. You choose r candies from the cups and thus end up with a bunch of r numbers, some of which may be the same. The question is how many different collections of numbers can you get?

Although the question is clear, solving it doesn't seem easy. The answer will be an expression in terms of u, v, w and r. I imagine there's a standard distribution for this sort of thing. I thought maybe hypergeometric, but on a quick consideration, it didn't seem to fit. I can write it as a rather long, messy expression with multiple nested sums. There may be a slicker way though.
 
It is not a probability generating function. This for a combinatorics class. The chapter is called "generating function models" and for this question we don't have to solve the problem, we only have to model it with a "generating function". The reason r is not included in the problem is because the answer would be the number of the coefficient of x^r when the expression is multiplied out (I am pretty sure)
 
I see. Well in that case your solution is correct!
 
  • Like
Likes toothpaste666
I find this chapter to be very abstract and confusing :/
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top