In the selection, the order doesn't matter, then you could use a combination. The formula is:
![C(n,r)=(n!)/(r!(n-r)!)](https://img.qammunity.org/2023/formulas/mathematics/high-school/6w59b5bnx99xew2xcl88ekb8s5usdpz7zk.png)
Where n is the number of things to choose from and r is the amount we choose.
Then if there are 6 teaches and the committee must be formed with 3 of then, the combinations are:
![\begin{gathered} C(6,3)=(6!)/(3!(6-3)!) \\ C(6,3)=(6!)/(3!(3)!) \\ C(6,3)=20 \end{gathered}](https://img.qammunity.org/2023/formulas/mathematics/college/oihwt8gz00qs8aghkitantwil7ow8yqtyy.png)
And also there are 10 students and the committee must be formed by 7 of them, then the combinations are:
![\begin{gathered} C(10,7)=(10!)/(7!(10-7)!) \\ C(10,7)=(10!)/(7!(3)!) \\ C(10,7)=120 \end{gathered}](https://img.qammunity.org/2023/formulas/mathematics/college/2gvr5m92rwdi2ywgs0iqmyqcm8b7tvs4ln.png)
And finally, the total number of ways the committee could be made is:
![C(6,3)* C(10,7)=20*120=2400](https://img.qammunity.org/2023/formulas/mathematics/college/eh1x48as7qn2ow2gkv2adpcr4s48yrm2sa.png)
Answer: 2400 ways