In how many ways can we select objects from a collection of size that consists of distinct and identical objects?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We can select k objects from the collection of n distinct objects and n − k objects from the collection of n identical objects in ( k n ) ways, making the answer k = 0 ∑ n ( k n ) = 2 n .