返回题库

AIME 1999 · 第 13 题

AIME 1999 — Problem 13

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

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 mn, where mm_{} and nn_{} are relatively prime positive integers. Find log2n.\log_2 n.

解析

Solution

There are (402)=780{40 \choose 2} = 780 total pairings of teams, and thus 27802^{780} possible outcomes. In order for no two teams to win the same number of games, they must each win a different number of games. Since the minimum and maximum possible number of games won are 0 and 39 respectively, and there are 40 teams in total, each team corresponds uniquely with some kk, with 0k390 \leq k \leq 39, where kk represents the number of games the team won. With this in mind, we see that there are a total of 40!40! outcomes in which no two teams win the same number of games. Further, note that these are all the valid combinations, as the team with 1 win must beat the team with 0 wins, the team with 2 wins must beat the teams with 1 and 0 wins, and so on; thus, this uniquely defines a combination.

The desired probability is thus 40!2780\frac{40!}{2^{780}}. We wish to simplify this into the form mn\frac{m}{n}, where mm and nn are relatively prime. The only necessary step is to factor out all the powers of 2 from 40!40!; the remaining number is clearly relatively prime to all powers of 2.

The number of powers of 2 in 40!40! is 402+404+408+4016+4032=20+10+5+2+1=38.\left \lfloor \frac{40}{2} \right \rfloor + \left \lfloor \frac{40}{4} \right \rfloor + \left \lfloor \frac{40}{8} \right \rfloor + \left \lfloor \frac{40}{16} \right \rfloor + \left \lfloor \frac{40}{32} \right \rfloor = 20 + 10 + 5 + 2 + 1 = 38.

78038=742780-38 = \boxed{742}.