In how many ways can I choose 3 captains from a team of 11 people?
This is a problem of counting combinations, where the order of the selection does not matter. I can use the formula for the number of combinations of n objects taken r at a time, which is nCr = n! / (r! (n-r)!), where ! means factorial. In this case, n is 11 and r is 3, so I plug those values into the formula and simplify. 11C3 = 11! / (3! (11-3)!) = 11! / (3! 8!) = (11 * 10 * 9 * 8!) / (3! 8!) = (11 * 10 * 9) / (3 * 2 * 1) = 165. Therefore, there are 165 ways to choose 3 captains from a team of 11 people. 