Loading [MathJax]/jax/output/HTML-CSS/jax.js

Sunday, July 21, 2024

Tour de Fiddler fun

This time around, a lone rider in the Tour de Fiddler is being pursued by a group of four riders. The four riders have an advantage—they take equal turns being in the lead position, while the other three riders draft behind. At any given speed, being in the lead position (as well as riding solo) requires twice as much power as drafting.

Assume that every rider must maintain the exact same average power over time, whether they are the lone rider or in the pack of four. To be clear, their power can change over time, but the time-averaged value must be the same for every rider. Also, when leading a pursuing group or riding solo, one’s speed is directly proportional to one’s power. When drafting, one's speed matches that of the leader (again, at half the power output).

The pursuers just passed under a banner indicating there are 10 kilometers left in the stage. How far back of the lone rider can they afford to be, such that they still catch them at the finish line?

Let's first start with some preliminaries. Assume that all riders have average power output ˉP, such that, since speed is directly proportional to ones power, then the average speed of a single rider who has no one to draft off of is v1=CˉP, for some constant of proportionality C>0.

Let's now analyze what would happen if k riders work together, taking equal turns being in the lead position. Since the average power must be ˉP, but any of the riders in this group spends only 1k amount of time leading and the rest drafting at half-power, the amount of power spent while leading a pack of k riders, say Pk, can be found in the equation ˉP=1kPk+k1k12Pk=k+12kPk, that is, Pk=2kk+1ˉP. So that means that the average velocity of a group of k riders working together must be vk=CPk=C2kk+1ˆP=2kk+1v1.

Ok, so with that in mind, the pursuers will finish in T4=10v4=254v1, while if the leader has a lead of x kilometers, then he will finish in T1=10xv1. Since we want T4=254v110xv1=T1 in order for the pursuers to catch the leader, then the leader can be no more than x154=3.75 kilometers ahead of the pursuers if they want to catch him.

In today’s stage of the Tour de Fiddler, there are 176 total riders. Some riders are grouped together in a single breakaway, while the remainder are grouped together in the peloton. The breakaway group is 10 kilometers from the finish, while the peloton is one kilometer behind (i.e., 11 kilometers from the finish). What is the smallest number of riders that the breakaway needs to reach the finish line before the pursuing peloton?

Let's say there are B riders in the breakaway group and P riders in the peleton, where here B+P=176. The average speed of the peleton will be vP=C2PP+1v1, while the average speed of the breakaway is vB=C2BB+1v1, so the finishing times are TP=11vP=11(P+1)2Pv1 and TB=10vB=10(B+1)2Bv1, respectively. Since we want the breakaway group to win the stage, we must have TBTP, or equivalently 10B+10B11P+11P, which is again equivalent to BP+11B10P0. Since we have restriction that B+P=176, we are now looking for the minimum integer B such that B(176B)+11B10(176B)=B2+197B17600. Since the quadratic inequality holds for all (real) values of B[197317692,197+317692], we see that the breakaway must have at least Bmin=197317692=9.3806979381....=10 riders in order to beat the peleton.

No comments:

Post a Comment