About this question
Hard · Conditional Probability · Quant Trader interview question · combinatorics, probability, stars-and-bars, mental-math
Three pirates, Anne, Bonnie, and Charlie, have plundered a chest containing 10 identical gold coins. They decide to divide the coins among themselves. How many different ways can they distribute the coins, assuming each pirate can receive any number of coins (including zero)? Use $n = 10$ (number of coins) and $k = 3$ (number of pirates).