I have to purchase some items.
We have to tell how many ways are there to select N items of K types.
However, the constraint here is we need to have at least one item of each type.
How many ways exist?
I have to purchase some items.
We have to tell how many ways are there to select N items of K types.
However, the constraint here is we need to have at least one item of each type.
How many ways exist?
The requirement that we select at least one item of each type forces K items in our selection to contain one instance each of all the items on offer, so this part of the selection may be ignored. This leaves a choice of $N-K$ items from K types where the order doesn't matter and the number of ways this latter choice can be made is given by the multicombination $$\left(\!\!\binom{K}{N-K}\!\!\right)=\binom{K+N-K-1}{N-K}=\binom{N-1}{N-K}$$ This is the answer to your question.
But i want atleast 1 object of each type
– user249117 Aug 21 '16 at 08:16