Find a function M(n)which gives the number of matches that are required to determine the champion of the number of contestants in the tournment, n is equal or larger than 2. Explain reasoning. Assume that the Rock Paper Scissors Championship is a single elimination tournament, i.c. the loser of a match is out and the winner advances. If during any round there are an odd number of contestants, one contestant draws a bye (ie he sits out until the next round).
2006-11-18 05:30:09 · 3 answers · asked by bala7425 1 in Science & Mathematics ➔ Mathematics
Each match eliminates exactly 1 person. That is, there's a bijection between matches and contestants eliminated. Since there are n-1 contestants eliminated, the total number of matches is just:
M(n) = n - 1
2006-11-19 07:44:56 · answer #1 · answered by shimrod 4 · 0⤊ 0⤋
The function for that problem is non existant, for the equation would be a pattern of increasing powers, such as
f(x)=1+nx+px^2-nx^3-px^4+nx^5...
the only way you would be able to write the problem on a piece of paper was to state what n and p are and explain the terms of the powers, but I don't have that much time on my hands.
2006-11-18 14:02:28 · answer #2 · answered by merviedz trespassers 3 · 0⤊ 0⤋
How much time do you actually have?
2006-11-18 13:33:45 · answer #3 · answered by spir_i_tual 6 · 0⤊ 0⤋