Combinatorial Question (Numbers of combinations)

  • Thread starter Thread starter ych22
  • Start date Start date
  • Tags Tags
    Combinations
ych22
Messages
114
Reaction score
0

Homework Statement



In how many ways can 12 balls be arranged into 4 different rows with each row having at least one ball if there are 6 identical red balls and 6 identical white balls?

Homework Equations



number of combinations of N objects into r groups is \frac{(N+r-1)!}{N!(r-1)!}.


The Attempt at a Solution



I thought of two directions
1) First number of arrangements the 12 balls into 4 rows without the requirement of minimum of one ball in each row. Then find the number of combinations in which the requirement is not met. Deduct the latter from the former.

2) Pick the first ball in each row first. Then find the number of combinations to distribute the remaining balls.

Either way, I'm stuck on the math! I think I'm missing a deceptively easy way to look at the problem. Any hints would be appreciated.
 
Physics news on Phys.org
i would first assume you have 12 balls, and deal with the colours later

consider the 12 balls as follows
xxxxxxxxxxxx

partitioning them is the same as choosing 4 partitions from 11 available spots, example is given below
x|xxx|xx|xx|xxxxx

this will also guarantee there is at least one ball in each row, now include the different possible colour combinations
 
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