Question 250675
<font face="Garamond" size="+2">



One presumes that each of the sections of the course is identical to the others, hence the order in which the instructors are assigned doesn't matter.  The number of ways that *[tex \LARGE k] things can be chosen from a collection of *[tex \LARGE n] things where order doesn't matter is given by:


*[tex \LARGE \ \ \ \ \ \ \ \ \ \ \left(n\cr k\right)\ =\ \frac{n!}{k!(n\,-\,k)!}]


Your problem asks the question how many ways are there to select 6 things from a collection of 8 things.


On the other hand, if my presumption about order is incorrect, you can use the same formula by simply removing the factor of *[tex \LARGE k!] from the denominator.


John
*[tex \LARGE e^{i\pi} + 1 = 0]
</font>