Combinatorics : the stars and bars ways I have this problem with combinations that requires one to make a group of 10 from 4 objects and one has many of each of these 4 distinct object types.
This type of problem I believe would follow the Stars+Bars approach.
But I have difficulty visualizing it this way.
So to make a context based example, say we have 4 veggies these being:
S-spinach
C-corn
T-tomato
B-broccoli
We have as many of these veggies that we need.
So the addition to this problem is that we must have at least 1 Tomato and at least 2 Broccoli.
If the total amount of each veggies was finite, then one can do a product of Combinations(regular type of combination) 
Since we have this infinite amount of veggies then we use, i guess the formula:
C(m+n-1,m), is now used for the Combinations, but this would mean we look at it from Bars and Stars way.
So an example possible list is:
TBBXXXXXXX
Where X represents any of the other veggies.
Another:
TTBBXXXXXX
etc
So there is a lot of combinations to go thru when AT Least is fairly small.
I guess one can do the inclusion-exclusion principle on this then.
But not fully certain how to go forward.
Hope someone can help here.
 A: In your example you can think of it as the number of sollutions to the equation
$S + C + T + B = x$ 
Where $S,C,T,B$ are the total number of each vegetable, and $x$ is the total number of vegetables. Which is a standard stars and bars problem like you said.
To use a concrete example lets say $x = 10$. So the answer above is simply $\binom{4 + 10 -1}{10}$
With the stipulation that you must have at least one tomato and at least two broccoli. It's still the same problem, except now you start out knowing what 3 of the vegetables are. So it's the number of solutions to
$S + C + T + B = 7$ and we have an answer of $\binom{4 + 7 - 1}{7}$
A: You are looking for the number of combinations with repetition. The number of combinations of size $k$ of $n$ objects is $\binom{n+k-1}{k}$.
$$\binom{4+10-1}{10}=286$$
Because their number is too large, it wood be no good way to try to write down all these combinations by hand. (There are generating algorithms available for this kind of combinations.)
You would calculate all integer partitions of 10 of length $\le$ 4. Its number is 23. Take e.g. the partition (1,2,2,5). You would choose all combinations where one of your 4 objects is contained 1 times, another of your 4 objects is contained 2 times, again another also 2 times and again another 5 times. You should generate this combinations with the same systematic procedure. You can use also the inclusion-exclusion principle.
You can represent your combinations graphically by the stars and bar method, but this is not necessary. You can use your representation with S, C, T and B. To proceed systematically, you should sort your symbols in the combinations alphabetically.
