Given N balls which are red, green or blue in color.And three boxes R,B,G.In how many ways these N balls can be distributed so that box R contains atleast r no of red balls, B contains atleast b no of blue balls , and G contains atleast g no of balls. Note balls of same color are indistinguishable.
What I am trying to build is a recurrence relation.But problem is that the boxes may contain more than the balls atleast required also ...Nd this is where i am not able to move forward..
please help to me find a recurrence relation f(r,b,g,N)=??
for base cases it should be following two condition
r+b+g<=N and max(r,g,b)<=N