Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A school has chess players. A team of is chosen, and one of the four is named captain.
For binomial coefficients, , and if with then . Pascal's rule is . Neighbours satisfy , and .
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Team first. There are teams, and each has possible captains. So .
Step 2. Captain first. The captain can be any of the players. Then more come from the other : . So .
Answer: both ways. This is the identity .
Log in to join the discussion.
Loading…
With Standard, you also open 11 more problems, 2 Python labs and 1 extra course. Everything you have used here stays free, always.