olymmath

HMMT November 2024 U35

  • Guts

There are 1024 players, ranked from 1 (most skilled) to 1024 (least skilled), participating in a single elimination tournament. In each of the 10 rounds, the remaining players are paired uniformly at random. In each match, the player with a lower rank always wins, and the loser is eliminated from the tournament.

For each positive integer n∈[1,1024]n \in[1,1024], let f(n)f(n) be the expected number of rounds that the participant with rank nn participates in. Estimate the minimum positive integer NN such that f(N)<2f(N)<2.

Submit a positive integer EE. If the correct answer is AA, you will receive max (0,20−⌊∣E−A∣2⌋)\left(0,20-\left\lfloor\frac{|E-A|}{2}\right\rfloor\right) points. Proposed by: Aaron Guo

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2024/u35 · Tag 618WGVCNNK · Edit this page on GitHub · Keys: j next, k previous