# Math Help - Results Pool

1. ## Results Pool

There is a betting where you bet on football teams. There are three options available for every game played, 1, X or 2. 1 = win for home team, X = tie and 2 = win for visiting team.

On every seies you bet on 13 teams: 1, X or 2.

How many different series are there with exactly

a) 11 "rights"
b) n "rights", where 0<= n<=13

2. From the wording, it is not clear to me if we have 13 games and thus 26 teams; or if we have 13 teams and thus only six games?

Let’s assume we have 13 games. So there is a string of 1’s, 2’s, or X’s that has length 13.
If that is the case, there are $3^{13}$ possible different such strings.