easy Probability
A release-checked easy problem for training Multinomial Coefficient.
You have $n \geq 2$ students that you need to see $k$ times each over the next month. You have $nk$ total appointment spots available for students to select from. However, one of the students can't attend in the first time slot. How many different ways can these students be scheduled when $n = 4$ and $k = 3$.
This Probability problem is tagged Multinomial Coefficient. State the random variables and conditioning information explicitly, then check the result against boundary cases before opening hints or a solution.
Probability · Akuna
Probability
Probability
Probability · SIG, DE Shaw
Probability · SIG, Jane Street
Probability · Jane Street