There are $n$ different types of objects and $k$ positions where an object can be placed. How can I determine the number of ways in which these $k$ positions can be filled by using objects of these $n$ types?

Any number of objects from a given type can be used and two objects of the same type are indistinguishable.

  • $\begingroup$ In each position is there to be just one object ? $\endgroup$ Apr 15, 2016 at 10:59

1 Answer 1


You have $n$ different options for each of $k$ positions, and they're all independent, so by the multiplication principle there are $n^k$ possibilities.


You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .