Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Combinatoricshard
0:00.0

Find the number of ways to choose a subcommittee of 5 from 10 people such that at least one of the two rivals, A or B, is included, but they are not both included.