Maths Olympiad Prep

Library / /80 of 92

Algebra Difficulty 7.3 National olympiad, round 2 Prove it Iran

The escalator of “Champion Butcher” metro station has this property that if mm persons are on it, its speed is mαm^{-\alpha} where α\alpha is a positive constant number. Suppose that nn persons want to go upstairs by the escalator. If the length of the escalator is ll, what is the least time required for these persons to go to upstairs? (Suppose the persons can use the escalator simultaneously at any time).

Figure 1

Solution

In every moment consider the number of persons that are on the escalator at that time. Now consider the intervals such that in every time of such intervals the number of persons on the escalator is equal to a fixed integer. Suppose that we have kk intervals I1,I2,,IkI_1, I_2, \dots, I_k and for 1ik1 \le i \le k, aia_i and lil_i denotes the length and number of persons on the escalator in every moment of IiI_i. We claim that i=1kai1αti=nl\sum_{i=1}^{k} a_i^{1-\alpha} t_i = nl.

Since every person have moved a distance equal ll so the sum of travelled distance of people is nlnl. On the other hand travelled distance of a person who is on the escalator on the interval IiI_i equals aiαtia_i^{-\alpha} t_i. So the sum of travelled distance in the interval IiI_i equals aiaiαti=ai1αtia_i \cdot a_i^{-\alpha} t_i = a_i^{1-\alpha} t_i, hence the total travelled distance is i=1kai1αti\sum_{i=1}^{k} a_i^{1-\alpha} t_i.

So the claim is proved.

Now consider the following cases.

Case 1. α1\alpha \ge 1. If ai1a_i \ge 1 since α1\alpha \ge 1 we have aiα11a_i^{\alpha-1} \ge 1, hence ai1α1a_i^{1-\alpha} \le 1. If ai=0a_i = 0 also ai1α=01a_i^{1-\alpha} = 0 \le 1. So nl=i=1kai1αtii=1ktinl = \sum_{i=1}^k a_i^{1-\alpha} t_i \le \sum_{i=1}^k t_i. So the required time is at least nlnl. If each person goes on the escalator when the previous one reached the top of the escalator the required time equals nlnl. Hence in this case the required time is at least nlnl.

Case 2. α<1\alpha < 1. Since ai<na_i < n and 1α>01 - \alpha > 0 we have ai1α<n1αa_i^{1-\alpha} < n^{1-\alpha} so
nl=i=1kai1αtii=1kn1αti=n1αi=1ktinαli=1kti nl = \sum_{i=1}^{k} a_{i}^{1-\alpha} t_{i} \leq \sum_{i=1}^{k} n^{1-\alpha} t_{i} = n^{1-\alpha} \sum_{i=1}^{k} t_{i} \Rightarrow n^{\alpha} l \leq \sum_{i=1}^{k} t_{i}
So the required time is at least nαln^\alpha l. If all nn people go on the escalator together the velocity equals nαn^{-\alpha} and so the required time equals lnα=nαl\frac{l}{n^{-\alpha}} = n^\alpha l. Hence in this case the required time is at least nαln^\alpha l. \square

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.