|
|
My answer is same as the winner's answer but i 'll try to explain my method in a much simpler way.
consider the no. of gaps ( students) in between 2 chosen students. let them be x1, x2, .. x7. total no. of such gaps = 16 - 7 =9
Therefore x1 + x2 + x3 + x4 + x5 + x6 +x7 = 9
the no. of solutions of this equation is ( 9-1 ) C ( 7 - 1) = 8C6
now the first person can be chosen in 16 ways. and it does not matter which of the 7 students in the final answer is the first student .
So the final answer is 16 8C6 / 7
|