Thursday, July 22, 2010

Finite help..please help..this is a very difficult problem?

two teams A and B are playing in a tournament where the first team to win five games wins. How many sequences are there? There are no ties.....

PLease Help.Please show me how to do this
If team A wins the tournament, then it wins the last game (because once they win the 5th game, the tournament ends). So list all sequences with 4 wins for A and either 0, 1, 2, 3 or 4 wins for B; and put a win for A at the end of all of them:

4 wins for A and 0 wins for B obviously has only one sequence: AAAA

4 wins for A and 1 win for B has 5 sequences: BAAAA, ABAAA, AABAA, AAABA and AAAAB. This is expressed as 5C1, or

No comments:

Post a Comment

Science & Mathematics