Generating Function for Selecting Candies with Varying Quantities and Types

Click For Summary
The discussion revolves around finding a generating function to determine the number of ways to select r candies from varying types and quantities. The proposed generating function is (x^0 + x^1)^u (x^0 + x^1 + x^2)^v (x^0 + x^1 + x^2 + x^3)^w, but there is confusion regarding the meaning of 'generating function' and the role of 'x'. It is clarified that this is not a probability generating function, but rather a combinatorial model for the problem at hand. The challenge lies in expressing the solution in terms of u, v, w, and r, with the goal of identifying the coefficient of x^r in the expanded expression. The conversation highlights the abstract nature of the topic, emphasizing the need for clarity in understanding generating functions in combinatorics.
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 :/
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K