Lose the sprint, win the marathon

Chris has just completed the Tour de France 2015, after 21 grueling races. There were 198 riders in the Tour de France competition. After the first few days, Chris was always showing signs of hopelessness. Coincidentally, he ranked n n -th in each individual race. However, much to his astonishment, he ended up taking home a gold medal because, despite his seemingly lackluster performance, he still managed to finish with the fastest combined time!

What is the maximum possible value of n n ?

Image Credit: Flickr Peter Mooney .


The answer is 188.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Alex Li
Jul 30, 2015

Clearly, if Chris lost to any other player in all 21 21 races, he could not have taken 1 1 st place overall, because the other player would have been faster than he was. We claim that his worst possible position is 188 188 th.

If he ranked 188 188 th in each race, it is possible for him to have lost by only 1 1 second to the 187 187 faster competitors in each race, but be faster than all of the other 10 10 by hours. Since he was faster than 10 10 competitors in each race, and there are 21 21 races, it is possible for him to have been faster than all of the other 197 197 competitors in at least one race. Note that, since he only lost by a second when he lost and won by hours when he won, his overall time would still be faster than the other 197 197 competitors, because his margin of winning is more than his margins of losing combined.

If he ranked 189 189 th in each race, he would've been faster than 9 9 competitors in each race. Since there are only 21 21 races, and 9 × 21 = 189 < 197 9\times21=189<197 , by Pigeonhole, there must exist a player who was faster than Chris in all races. Thus, it would've been impossible for him to have the fastest overall time.

The final answer is thus 188 \boxed{188} .

Moderator note:

Great explanation! This shows that you don't always need to be at the top, in order to be the best overall. Fantasy sports players know this very well, when they need to find a specific person for a position, but have only stacked their team with all-rounders.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...