Question is described here last question G1†
Solution is here last solution
Please explain the solution in simple language.
And please explain how to do it using partition.
My approach using partition:
$r: red\ beens,\ o: orange\ beens,\ y: yellow\ beens,\ g: green\ beens,\ b_l: blue\ beens,\ b_k: black\ beens,\ w: white\ beens,\ v: voilet\ beens$
$r = o,\quad y = g,\quad b_l = b_k - 1,\quad w = v - 3$
$r + o + y + g + b_l + b_k + w + v = 200$
by given info:
$r + y + b_k + v = 102$
Using Partition rule:
If we partition n into k parts: $n_1,n_2,....,n_k$
$$ no.\ of\ ways\ we\ can\ do\ it= \frac{n!}{(n-(n_1 + n_2+...+n_k))*n_1!*n_2!*...*n_k!} $$
$$if \quad n_1 + n_2 + ....+n_k = n$$
$$ no.\ of\ ways\ we\ can\ do\ it= \frac{n!}{n_1!*n_2!*...*n_k!} $$
now our n = 102, k = 4, $\quad n_1 = r,\ n_2= y,\ n_3=b_k,\ n_4=v$
$$number\ of\ jars = \frac{102!}{r!*y!*b_k!*v} $$
now am stuck at this point where am lacking or complete approach to this question is wrong ?