Respuesta :
The number of ways for six ce majors and ten cs majors to stand in a line so that no two ce majors stand next to each other are 462.
We need to maintain one condition that no two ce majors stand next to each other.
So, what we can do firstly we allow ten cs majors to stand in a line as there are no restrictions on cs majors.
Total number of ways by which ten cs majors can stand=10!=3628800
Now, when 10 cs majors stand in a line then we have 11 spaces.
Now, we need to choose such space for 6 ce majors so that no two ce majors stand next to each other.
So, it is equivalent to choose 6 spaces from 11 spaces which is given by [tex]^1^1C_6[/tex] ways =(11!)/(6!×5!)=11×2×3×8×7=462ways.
Hence, total number of ways are 462.
To know more about Permutations and Combinations, visit here:
https://brainly.com/question/13387529
#SPJ4
