A company has 11 comp engg and 7 mech engg. In how many ways can they be seated
around a round table so that all mech engg dont sit together.
a.17!-(11! x 6!)
b.17!-(11! x 7!)
My sol -- all never together = total permutation - all mech engg together
i.e. 17! - (6! x 11!)
Please give your explanations.![]()
around a round table so that all mech engg dont sit together.
a.17!-(11! x 6!)
b.17!-(11! x 7!)
My sol -- all never together = total permutation - all mech engg together
i.e. 17! - (6! x 11!)
Please give your explanations.
