Hi all,
I’ve solved all variants of 16.1 except two of them (p.305). And I totally have no idea about these two questions. Could you guys give some hints to solve this? The questions are below.
-
Suppose the final score is (s,s’). Team 1 scored s points and Team 2 scored s’ points. How would you compute the number of distinct scoring sequences which result in this score?
-
Suppose the final score is (s,s’). How would you compute the maximum number of times the team that leads could have changed?
Thank you