Who has the wisdom to answer the following:
9 distinct marbles distrubted into 4 distinct bags with each bag receiving at least 1 marble,how many ways can this be done?
Thankyou for contributing!
Regards
Who has the wisdom to answer the following:
9 distinct marbles distrubted into 4 distinct bags with each bag receiving at least 1 marble,how many ways can this be done?
Thankyou for contributing!
Regards
Copyright © 2021 JogjaFile Inc.
James Stirling has the wisdom.
In this case, we multiply by $k!$ since we have labeled subsets. So the number is $$4!\ S(9,4)=186480.$$