Problem
COM-B1-M03-P009 At Least One Top Student
#9
★★☆☆☆ Level 2 of 5
In a group of \(10\) students, \(3\) are top students. In how many ways can a team of \(4\) be chosen so that it contains at least one top student?
All teams minus teams without top students.
Total: \(\binom{10}{4}=210\). Without top students, choose \(4\) from the other \(7\): \(\binom{7}{4}=35\). Answer: \(175\).
Classic at least by complement.