Math, asked by sanjar86, 10 months ago

8 players S1, S2, ....., S8 play in a tournament. Find the no of ways in which they can be grouped such that S1 and S2 are never together.

Answers

Answered by kritansh7
3
1) they can group all the players with odd no.
Similar questions