Solving Combinatorics Problem: Distributing 20 Candies Among 6 Children

  • Thread starter Thread starter vector
  • Start date Start date
  • Tags Tags
    Combinatorics
AI Thread Summary
The discussion revolves around solving a combinatorics problem of distributing 20 candies among 6 children, with the youngest receiving at most 2 candies. One participant outlines a solution using three cases based on how many candies the youngest child receives, calculating a total of 102,487 ways. Another participant questions the instructor's solution from the study guide, suggesting it incorrectly includes the youngest child in the distribution when they receive zero candies. The consensus leans towards the initial participant's method being correct, emphasizing the need to consider the youngest child separately in the distribution calculations. The conversation highlights the importance of correctly interpreting the problem's constraints in combinatorial solutions.
vector
Messages
15
Reaction score
0
Hello Everyone,

There is one interesting exercise in which it is asked to solve the following problem:

In how many ways can we distribute 20 candies among 6 children so that the youngest gets at most 2 candies?

This is my version of the solution:

Case 1: youngest child gets no candies, thus we have to distribute the 20 candies among 5 children, so we have C(20+5-1, 5) = 42 504

Case 2: youngest child gets one candy, thus we give him one candy, and then we have 19 candies to distribute between the other 5 children: C(19+5-1, 5) = 33 649

Case 3: youngest child gets two candies, so we give him two, and then we have 18 candies to distribute among the other 5 children: C(18+5-1, 5) = 26 334

And the total comes to 42 504 + 26 334 + 33 649 = 102 487 ways to distribute the candies.

This is the instructor's version of the solution, whose answer matches the answer in the study guide:

You have x1 + x2 + x3 + x4 + x5 + x6 = 20
Nw we will discuss x1, consider y1=x1-i where i is 0, 1, or 2..

So for i=0 we still have x1=y1 and then we still have x1 + x2 + x3 + x4 + x5 + x6 = 20 now I think we can consider x1 as x1=0 is a "choice".

To understand my point if you consider x1=1 then using you thinking we will get to x2 + x3 + x4 + x5 + x6 =19 and the answer will be C(19+5-1,19)=C(23,19) however.

If you consider i=1 so x1=y1+1 and then the answer will be C(19+6-1,16)=C(24,19), so 6 is always kept for all cases.


My question is: which solution is correct?
 
Mathematics news on Phys.org
If the candies are distinct, then your solution is correct. On the other hand, if they are identical then the instructor's version is correct.
 
Adithyan, I'm probably missing some important point. Let me explain.

Here's the solution in the study guide:

Case one, x1=0. The youngest child gets zero candies: x1+x2+x3+x4+x5+x6=20. Now, they say, in this case we have C(20+6-1, 20) = 53,130.

But here's my view: in this equation, we have all six x's, representing all six children. So, we are calculating the number of ways 20 candies can be distributed among the six children, including the youngest child, because x1 can vary from 0 to 20. Shouldn't we exclude x1 altogether, if it represents the youngest child who gets 0 candies?

Case two, the youngest child gets two candies. The study guide says that we must have y1+x2+x3+x4+x5+x6=19, where y1=x1-1.

But in this case, aren't we distributing 19 candies among six children, as opposed to 19 candies which should be distributed among five children (because one candy has already been given to the youngest child)?

Likewise for the third case.

Thank you :)
 
I agree with you. I think the solution is incorrect. As you have pointed out, all we have to do is make three cases (i.e, x1=0, x1=1 and x1=2) and distribute the remaining chocolates to the other five kids.
 
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top