0
$\begingroup$

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.

$\endgroup$
  • $\begingroup$ In each position is there to be just one object ? $\endgroup$ – true blue anil Apr 15 '16 at 10:59
2
$\begingroup$

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.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.