Maths Olympiad Prep

Library / /24 of 24

, 2016

Number theory Difficulty 7.7 National olympiad, round 2 Prove it Argentina

Let ABAB a line segment of length 11. Several elementary particles start moving simultaneously at constant speeds from AA to BB. As soon as a particle reaches BB, it turns around and heads to AA; when reaching AA, it starts moving to BB again, and so on indefinitely.
Find all rational numbers r>1r > 1 with the following property: For each n1n \ge 1, if n+1n+1 particles with speeds 1,r,r2,,rn1, r, r^2, \dots, r^n move as described, there is a moment when all particles are at the same interior point of segment ABAB. (Ignore the dimensions of the particles; assume that they can all gather at one point.)

Solution

The values in question are all integers rr greater than 11.

We start with a general observation about two particles P1P_1 and P2P_2 moving on ABAB by the given rules, with different constant speeds v1v_1 and v2v_2, v1>v2v_1 > v_2. Suppose that they are at the same point QQ of ABAB at a certain moment tt. There are two possibilities for the distances v1tv_1 t and v2tv_2 t the particles have traveled until that moment. If P1P_1 and P2P_2 are moving in the same direction when they simultaneously reach QQ, then the integer parts of v1tv_1 t and v2tv_2 t have the same parity, and their fractional parts are equal. Hence v1tv2tv_1 t - v_2 t is an even positive integer. And if P1P_1 and P2P_2 are moving in opposite directions when they meet at QQ, then the integer parts of v1tv_1 t and v2tv_2 t have different parity, and the sum of their fractional parts is 11. Therefore v1t+v2tv_1 t + v_2 t is an even positive integer.

Now let the rational r>1r > 1 have the stated property, for any number n+1n+1, n1n \ge 1, of particles with speeds 1,r,r2,,rn1, r, r^2, \dots, r^n. Let tt be a moment when all of them are at the same point. Then all of them are at the same point of ABAB at instant tt. Apply the observation to the first and the last particle, with speeds v1=rnv_1 = r^n and v2=1v_2 = 1. We infer that (rn1)t(r^n - 1)t or (rn+1)t(r^n + 1)t is an integer. Because rr is rational, tt is rational too. Write rr and tt as irreducible fractions: r=abr = \frac{a}{b}, t=cdt = \frac{c}{d}. Then (rn±1)t=(an±bn)cbnd(r^n \pm 1)t = \frac{(a^n \pm b^n)c}{b^n d}. Since an±bna^n \pm b^n and bnb^n are coprime, it follows that bnb^n divides cc. Moreover, the latter holds for each n>1n > 1 by hypothesis. This is possible only if b=1b = 1, that is, if r>1r > 1 is an integer.

Conversely, every integer r>1r > 1 is a solution. Let r3r \ge 3 be odd and n1n \ge 1 arbitrary. Then all n+1n+1 particles with speeds 1,r,r2,,rn1, r, r^2, \dots, r^n will be at the midpoint of ABAB at t=12t = \frac{1}{2}. Indeed, rk12r^k \cdot \frac{1}{2} has fractional part 12\frac{1}{2} for each k=0,1,2,,nk = 0, 1, 2, \dots, n since rkr^k is odd.

Let r=2mr = 2m, m1m \ge 1, be even and n1n \ge 1 arbitrary. Then at the moment t=2m2m+1t = \frac{2m}{2m+1} all n+1n+1 particles with speeds 1,r,r2,,rn1, r, r^2, \dots, r^n will be at the point QQ at distance 2m2m+1\frac{2m}{2m+1} from AA. It is enough to prove that for each k=0,1,2,k = 0, 1, 2, \dots the next equality holds:

(2m)k2m2m+1={2q+2m2m+1con q=0,1,2, si k0 es par;2q+1+12m+1con q=0,1,2, si k1 es impar. (2m)^k \frac{2m}{2m+1} = \begin{cases} 2q + \frac{2m}{2m+1} & \text{con } q = 0, 1, 2, \dots \text{ si } k \ge 0 \text{ es par;} \\ 2q+1 + \frac{1}{2m+1} & \text{con } q = 0, 1, 2, \dots \text{ si } k \ge 1 \text{ es impar.} \end{cases}

Indeed, these relations mean that, for kk even, the particle with speed rkr^k will be moving from AA towards BB at the moment t=2m2m+1t = \frac{2m}{2m+1}, and it will be at distance 2m2m+1\frac{2m}{2m+1} from AA, that is, at point QQ.

For kk odd, the particle with speed rkr^k will be moving from BB towards AA at the moment t=2m2m+1t = \frac{2m}{2m+1}, and it will be at distance 12m+1\frac{1}{2m+1} from BB, hence at point QQ again.

So it remains to prove the displayed equalities, which we do by induction in kk. The case k=0k=0 is obvious. Proceed to the inductive step kk+1k \to k+1. The induction hypothesis yields

k odd: (2m)k+12m2m+1=2m(2q+1)+2m2m+1=2q+2m2m+1,q=0,1,2,; k \text{ odd: } (2m)^{k+1} \frac{2m}{2m+1} = 2m(2q+1) + \frac{2m}{2m+1} = 2q' + \frac{2m}{2m+1}, \quad q' = 0, 1, 2, \dots;
k even: (2m)k+12m2m+1=4mq+4m22m+1=4mq+2m1+12m+1=2q+1+12m+1,q=0,1,2, k \text{ even: } (2m)^{k+1} \frac{2m}{2m+1} = 4mq + \frac{4m^2}{2m+1} = 4mq + 2m - 1 + \frac{1}{2m+1} = 2q' + 1 + \frac{1}{2m+1}, \quad q' = 0, 1, 2, \dots

This completes the induction and the solution.

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.