Bravo good job both of you !! you are the only ones brave enough in this community to even attempt this !! well done !! Hats off to both of you .
well let the teams be A and B
there are 4 games in the tournament and if the last one decides the winner then
let - - - - ( Four dashes represent the 4 games )
winning score for A is A = 3 and B = 1 as A= 2 and B = 2 will result in a draw , so for A to win he must win 3 of the 4 games.
- - - A : here A wins , so that means the three games before the 4th game A must have won 2 times , and the final score must be A = 3 and B=1 , as the possibility of A winning all games has been has not been allowed in the question, so out of 3 space's in how many ways can we fill 2 A's ? yes that's 3C2 = 3
so total ways A can win is 3C2 *1 ( Last game A won , so only 1 way )= 3
( as shown by adthedaddy too)
similarly for B, suppose B wins then - - - B , so the 3 games before the 4th game must have 2 B's for B to finally win , that's 3C2 again so = 3
So total ways B can win with it winning the last game = 3c2 *1 = 3
Hence for the last game to decide the winner 3+3= 6 favorable outcomes
total outcomes for the 4 games = 2*2*2*2= 16 ( as there are two outcomes for each game )
hence probability = 6/16 = 3/8
Last edited by gmatter2012 on Thu Oct 11, 2012 11:26 pm, edited 2 times in total.