Maths Olympiad Prep

Library / /198 of 220

Algebra Difficulty 7.1 National Olympiad, round 2 Prove it Ukraine

a) For non-zero integers a,b,ca, b, c it holds that: a2b+b2c+c2a=a2c+c2b+b2a\frac{a^2}{b} + \frac{b^2}{c} + \frac{c^2}{a} = \frac{a^2}{c} + \frac{c^2}{b} + \frac{b^2}{a}.
Does it follow then that: ab+bc+ca=ac+cb+ba\frac{a}{b} + \frac{b}{c} + \frac{c}{a} = \frac{a}{c} + \frac{c}{b} + \frac{b}{a}?

6) Consider all triples of non-zero integers (a,b,c)(a, b, c), which belong to the interval [2020,2020][-2020, 2020]. Find for how many of them the conditions a+b+c=0a+b+c=0 and a2b+b2c+c2a=a2c+c2b+b2a\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{a}=\frac{a^2}{c}+\frac{c^2}{b}+\frac{b^2}{a} are equivalent? In other words, how many such triples are there, such that either both conditions hold, or none of the two holds?

Solution

Consider the following transformation:
(a2b+b2c+c2a)(a2c+c2b+b2a)=a3ca3b+b3aa3b+c3bb3cabc \left( \frac{a^2}{b} + \frac{b^2}{c} + \frac{c^2}{a} \right) - \left( \frac{a^2}{c} + \frac{c^2}{b} + \frac{b^2}{a} \right) = \frac{a^3 c - a^3 b + b^3 a - a^3 b + c^3 b - b^3 c}{abc}
Now we transform only numerator:
a3ca3b+b3aa3b+c3bb3c=(ba)(ab2+a2b+c2ca2abccb2)==(ba)(ab2+a2b+c2ca2abccb2)=(ba)(ac)(b2+abc2ca)==(ba)(ac)(bc)(a+b+c). \begin{aligned} a^3 c - a^3 b + b^3 a - a^3 b + c^3 b - b^3 c &= (b-a)(ab^2 + a^2 b + c^2 - ca^2 - abc - cb^2) = \\ &= (b-a)(ab^2 + a^2 b + c^2 - ca^2 - abc - cb^2) = (b-a)(a-c)(b^2 + ab - c^2 - ca) = \\ &= (b-a)(a-c)(b-c)(a+b+c). \end{aligned}
Therefore the condition a2b+b2c+c2a=a2c+c2b+b2a\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{a}=\frac{a^2}{c}+\frac{c^2}{b}+\frac{b^2}{a} for non-zero numbers a,b,ca, b, c is equivalent to condition: (ba)(ac)(bc)(a+b+c)=0(b-a)(a-c)(b-c)(a+b+c)=0.

a) Similarly we conduct following transformation:
(ab+bc+ca)(ac+cb+ba)=a2ca2b+b2aa2b+c2bb2cabc=(ba)(ca)(cb)abc=0. \left(\frac{a}{b} + \frac{b}{c} + \frac{c}{a}\right) - \left(\frac{a}{c} + \frac{c}{b} + \frac{b}{a}\right) = \frac{a^2 c - a^2 b + b^2 a - a^2 b + c^2 b - b^2 c}{abc} = \\ \frac{(b-a)(c-a)(c-b)}{abc} = 0.
Now, as a counter example let's choose a triple a=1,b=2,c=3a=1, b=2, c=-3. It satisfies the first equation because a+b+c=0a+b+c=0. However, the second equation is not correct:
ab+bc+ca=1223+31=34+186=176,ac+cb+ba=13+32+21=2+9+126=196. \frac{a}{b} + \frac{b}{c} + \frac{c}{a} = \frac{1}{2} - \frac{2}{3} + \frac{3}{1} = \frac{3-4+18}{6} = \frac{17}{6}, \quad \frac{a}{c} + \frac{c}{b} + \frac{b}{a} = -\frac{1}{3} + \frac{3}{2} + \frac{2}{1} = \frac{-2+9+12}{6} = \frac{19}{6}.

6) From transformations above we conclude that the required triples can be two types
Type 1. Integers a,b,ca, b, c are pairwise distinct.
Type 2. If at least two integers are equal, for example a=bca=b \neq c, then second equation is correct, while second is correct only if c=(a+b)c = -(a+b).
Now we count the number of such triples. The amount of pairwise different non-zero triples is 4040403940384040 \cdot 4039 \cdot 4038. For the Type 2, if a=bca=b \neq c, then there are 20202020 numbers to choose aa and then bb and cc are defined. Therefore, there are 320203 \cdot 2020 such triples.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.