#ThisWeeksFiddler, 20250321

This week the question is: Can You Play the Favorite?

March Madness—the NCAA basketball tournament—is here!

The single-elimination tournament consists of 64 teams spread across four regions, each with teams seeded 1 through 16. (In recent years, additional teams beyond the 64 have been added, but you needn’t worry about these teams for this week’s puzzle.)

Suppose in any matchup between teams with seeds M and N, the M-seed wins with probability N/(M+N), while the N-seed wins with probability M/(M+N). For example, if a 3-seed plays a 5-seed, then the 3-seed wins with probability 5/8, while the 5-seed wins with probability 3/8.

In one of the brackets, the top four seeds remain (i.e., the 1-seed, the 2-seed, the 3-seed, and the 4-seed). If case you’re not familiar with how such brackets work, at this point the 1-seed and 4-seed face off, as do the 2-seed and 3-seed. The winners then play each other.

What is the probability that the 1-seed will emerge victorious from this region?

And for extra credit:

As before, the probability that an M-seed defeats an N-seed is N/(M+N). But instead of 16 teams in a region, now suppose there are 2k teams, where k is a very large whole number.

The teams are seeded 1 through 2k, and play in a traditional seeded tournament format. That is, in the first round, the sum of opponents’ seeds is 2k+1. If the stronger team always advances, then the sum of opponents’ seeds in the second round is 2k−1+1, and so on. Of course, stronger teams may not always advance, but this convention tells you which seeds can play which other seeds in each round.

For any such region with 2k teams, what is the probability that the 1-seed emerges victorious from the region?

Highlight to reveal (possibly incorrect) solution:

Program .

And for extra credit:

Skriv en kommentar