1999 AIME Problem 13

Below is the professionally curated solution for Problem 13 of the 1999 AIME, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1999 AIME solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:basic probabilitypermutationsLegendre’s Formula

Difficulty rating: 2650

13.

Forty teams play a tournament in which every team plays every other team exactly once. No ties occur, and each team has a 50%50\% chance of winning any game it plays. The probability that no two teams win the same number of games is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find log2n.\log_2 n.

Solution:

There are (402)=780\binom{40}{2} = 780 games, hence 27802^{780} equally likely outcomes. If all 4040 win totals are distinct, they must be exactly 0,1,,39.0, 1, \ldots, 39. In that case the team with 3939 wins beat everyone, the team with 3838 wins beat everyone except that team, and so on: the assignment of totals to teams determines every game. Conversely each of the 40!40! assignments arises from exactly one outcome, so the probability is 40!2780.\frac{40!}{2^{780}}.

By Legendre's formula the power of 22 dividing 40!40! is 20+10+5+2+1=38.20 + 10 + 5 + 2 + 1 = 38. In lowest terms the denominator is therefore n=278038=2742,n = 2^{780 - 38} = 2^{742}, so log2n=742.\log_2 n = 742.

← Problem 12Full ExamProblem 14

Problem 13 in Other Years