An eccentric Computing Science Professor decides to hide their hoard of NSERC funded money, 100 identical gold coins, in 20 unique locations hidden across SFU. It is assumed that multiple coins or even none can be stored at each location.
a) How many ways can they distribute these coins without any
restrictions?
b) How many ways can they distribute these coins if each location
gets at least 5 coins?
Please show every step and write it CLEARLY!
Get Answers For Free
Most questions answered within 1 hours.