Question

Suppose four teams, numbered one through four, play a single-elimination tournament, consisting of three games. Two teams play each game and one of them wins; ties do not occur. The tournament bracket is as follows: teams one and another team play each other in the first game and the remaining two teams play each other in the second game; the winner of the first game plays the winner of the second game in the third game.

Define a set ΩΩ so the elements of ΩΩ correspond to the possible outcomes of the tournament. An element of ΩΩspecifies the entire sequence of outcomes of the games. How many outcomes are there for the combination of what bracket is used and the game outcomes? (Assume the order the two games are played in the first round does not matter. For example, they could be simultaneous.)

Answer 1

Notations {(p.9)& (,. 5) > (р. т) -> p} denotes p and q play the first game and p wins play the second game and r and s wins p and r play the third game and p wins total number of outcomes = total number of permutations of p,q,r, s = 24 Thus = set of all possible values of {p, q, r, s} {(p, q)&(r, s) - (p, r) -p} 11,3)& (2, 4) 11,4)& (3, 2) (2, 3)& (1, 4) (2,4)& (3, 1) (3, 2)&(1, 4) (3, 4)& (2, 1) (4, 2)& (1, 3) (4, 3)& (2, 1) set of all possible outcomes of ,2)& (4, 3) (1,4) 1,4)& (2,3) (2,3) -2 ; (2,1)&(4, 3) (2, 4)& (1,3) (1, 2)1 (1, 3) (2, 1)2 (2,3) ->2 ; (3, 1) 3 (3, 2) (4, 1) 4 (4, 2) = {(1, 2)& (3, 4) (1,3)& (4,2) (2, 1) (3,4) (2, 3)&(4,1) (3, 1) (2,4) (3, 2)& (4,1)(3,4) (4, 1)&(2,3)(4, 2) (1,3) (1,4) (1,2) (2,4) 2 - (2,1 +3 ; (3,1)&(4,2) 3 (3,4)&(1,2) (4,1& (3, 2) (4,2)& (3, 1)(4, 3) -> 4 ; (4,3)&(1,2) (2,4)2 (3,2) 2 (3,4) (3, 1) (4,3) (4,1) 3 3 4 4 4 } 4 Total number of out comes 24