Olympiad Maths Prep

Track / Stage 10 / 25 of 40 #1985 of 2000

Problem 1985

Hardest shortlist tier
Algebra Difficulty 9.3 Prove it Selection Examinations for the IMO 2015 · Slovenia · 2015

At the beginning we have a triple of pairwise distinct positive integers (a,b,c)(a, b, c) which satisfies a+b+c=2015a + b + c = 2015. Then in each step we replace the current triple of numbers (x,y,z)(x, y, z) with the triple (y+zx,z+xy,x+yz)(y + z - x, z + x - y, x + y - z). At least how many steps must we make so that starting with a triple (a,b,c)(a, b, c) we will certainly get a triple which has at least one negative number?

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Let's look at the sum of the triple. This does not change after each step since (y+zx)+(z+xy)+(x+yz)=x+y+z(y+z-x)+(z+x-y)+(x+y-z) = x+y+z. Moreover, the values of the new triple do not depend on the order of the numbers in the original triple, since the terms are symmetrical in all three variables. Hence we may assume a<b<ca < b < c and we can change the order of the numbers in the triple.

Solution 1: After the first step we get the triple (a+bc,a+cb,b+ca)(a + b - c, a + c - b, b + c - a) and we have
a+bc<a+cb<b+ca, a + b - c < a + c - b < b + c - a,
after the second step we get the triple (3abc,3bac,3cab)(3a - b - c, 3b - a - c, 3c - a - b) and we have
3abc<3bac<3cab. 3a - b - c < 3b - a - c < 3c - a - b.

Let's look at the differences between individual numbers of the triple. By induction we check that after nn steps we have the following:
* The difference between the smallest and the largest number in the triple is equal to 2n(ca)2^n(c-a).
* The difference between the smallest and the middle number in the triple is equal to 2n(ba)2^n(b-a) if nn is even and 2n(cb)2^n(c-b) if nn is odd.
* The difference between the middle and the largest number in the triple is equal to 2n(cb)2^n(c-b) if nn is even and 2n(ba)2^n(b-a) if nn is odd.

After nn steps we have the triple of the form (t,t+2n(ba),t+2n(ca))(t, t + 2^n(b-a), t + 2^n(c-a)) if nn is even and (t,t+2n(cb),t+2n(ca))(t, t + 2^n(c-b), t + 2^n(c-a)) if nn is odd. Here tt is some integer which can be calculated from the condition on the sum. We have
2015=t+(t+2n(ba))+(t+2n(ca))=3t+2n(b+c2a)t=20152n(b+c2a)3, if n even, and \begin{aligned} 2015 &= t + (t + 2^n(b-a)) + (t + 2^n(c-a)) = 3t + 2^n(b+c-2a) \\ &\Rightarrow t = \frac{2015 - 2^n(b+c-2a)}{3}, \text{ if } n \text{ even, and} \end{aligned}
2015=t+(t+2n(cb))+(t+2n(ca))=3t+2n(2cab)t=20152n(2cab)3, if n odd. \begin{aligned} 2015 &= t + (t + 2^n(c-b)) + (t + 2^n(c-a)) = 3t + 2^n(2c-a-b) \\ &\Rightarrow t = \frac{2015 - 2^n(2c-a-b)}{3}, \text{ if } n \text{ odd.} \end{aligned}
If any of the numbers in the triple will be negative, it will surely be tt. Since the sum of three consecutive numbers cannot equal 20152015, the difference between the largest and the smallest number in the initial triple is at least 33. This gives ca3c-a \ge 3. Thus we can estimate b+c2a=(ca)+(ba)4b+c-2a = (c-a)+(b-a) \ge 4 and 2cab=(ca)+(cb)42c-a-b = (c-a)+(c-b) \ge 4. It follows
t201542n3. t \le \frac{2015 - 4 \cdot 2^n}{3}.

With the initial triple (670,672,673)(670, 672, 673) we get t=201528(673+6722670)3=245t = \frac{2015-2^8(673+672-2 \cdot 670)}{3} = 245 after 88 steps. Therefore this triple does not yield a negative number after 88 steps.
So we have to make at least 99 steps to get a triple with at least one negative number.

Solution 2: Since a+b+c=2015a+b+c = 2015, after the first step we get the triple (b+ca,a+cb,a+bc)=(20152a,20152b,20152c)(b+c-a, a+c-b, a+b-c) = (2015-2a, 2015-2b, 2015-2c). Thus in each step the transformation acts component-wise by the rule x20152xx \mapsto 2015-2x.
We can check by induction that if we apply this transformation nn times to the number xx we get
(2)nx+1(2)n32015. (-2)^n x + \frac{1-(-2)^n}{3} \cdot 2015.

Let's determine when this number is non-negative. For even nn we must have
2nx+12n320150120153x201532n. \begin{aligned} 2^n x + \frac{1-2^n}{3} \cdot 2015 &\ge 0 \\ \Leftrightarrow \frac{1}{\frac{2015}{3}-x} \cdot \frac{2015}{3} &\ge 2^n. \end{aligned}

For odd nn we must have
2nx+1+2n3201501x20153201532n. \begin{aligned} -2^n x + \frac{1+2^n}{3} \cdot 2015 &\ge 0 \\ \Leftrightarrow \frac{1}{x - \frac{2015}{3}} \cdot \frac{2015}{3} &\ge 2^n. \end{aligned}

Since 20152015 is not a sum of three consecutive positive integers, we must have a670a \le 670 and c673c \ge 673. Inserting this in the above inequalities we get
2n120153a2015312015367020153=403n8, 2^n \le \frac{1}{\frac{2015}{3} - a} \cdot \frac{2015}{3} \le \frac{1}{\frac{2015}{3} - 670} \cdot \frac{2015}{3} = 403 \Rightarrow n \le 8,
2n1c201532015316732015320153=20154n8. 2^n \le \frac{1}{c - \frac{2015}{3}} \cdot \frac{2015}{3} \le \frac{1}{673 - \frac{2015}{3}} \cdot \frac{2015}{3} = \frac{2015}{4} \Rightarrow n \le 8.

So we have to make at least 99 steps to get a triple with at least one negative number.

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