Olympiad Maths Prep

Library / /10 of 11

, 2010

Number theory Difficulty 7.1 National olympiad, round 2 Prove it Ukraine

There are three runners in different vertices of an equilateral triangle with side 11: First, Second and Third. They start moving simultaneously in the same direction (Second in First's direction, Third in Second's direction, First in Third's direction). Is it necessary that they all meet in one point at the same time, if:

a) First, Second and Third have velocity 20082008, 20092009 and 20102010 respectively?

b) They are moving with distinct natural velocities?

Solution

Answer: a) necessary; b) not necessary.

a) We first write the condition, which implies that they eventually meet at one point: 2008t=2010t+13m=2009t+23n2008t = 2010t + 1 - 3m = 2009t + 2 - 3n, where m,nZ,tRm, n \in \mathbb{Z}, t \in \mathbb{R}. We have: t=3n2t = 3n - 2 or 2t=6n42t = 6n - 4. Moreover, 2t=3m13m1=6n4m=2n12t = 3m - 1 \Rightarrow 3m - 1 = 6n - 4 \Leftrightarrow m = 2n - 1, from that, we can easily find solutions, for instance, if m=n=1m = n = 1 then t=1t = 1. If t=1t = 1 then, indeed, First will run 20082008, Second 20092009, Third 20102010, hence, they will meet at one point.

b) Let us suppose that First, Second and Third have velocities 11, 22 and 44 respectively. Then, the condition that they meet at one point can be rewritten as follows: t=4t+13m=2t+23nt = 4t + 1 - 3m = 2t + 2 - 3n, m,nZ,tRm, n \in \mathbb{Z}, t \in \mathbb{R}. Then, t=3n2t = 3n - 2 and 3t=3m13t = 3m - 1. So we obtain the following equation: 9n6=3m19n - 6 = 3m - 1 for integer m,nm, n. This equation has no solutions, therefore, our runners will not meet at one point.

Looking for a route rather than 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.