Maths Olympiad Prep

Library /

Geometry Difficulty 6.6 National Olympiad Prove it JBMO

Problem:
Prove that there exist two sets A={x,y,z}A=\{x, y, z\} and B={m,n,p}B=\{m, n, p\} of positive integers greater than 20032003 such that the sets have no common elements and the equalities x+y+z=m+n+px+y+z=m+n+p and x2+y2+z2=m2+n2+p2x^{2}+y^{2}+z^{2}=m^{2}+n^{2}+p^{2} hold.

Problem:
Demonstraţi că există mulțimi disjuncte A={x,y,z}A=\{x, y, z\} și B={m,n,p}B=\{m, n, p\} de numere naturale mai mari ca 20032003 astfel ca x+y+z=m+n+px+y+z=m+n+p și x2+y2+z2=m2+n2+p2x^{2}+y^{2}+z^{2}=m^{2}+n^{2}+p^{2}.

Solution

Solution:
Let ABCABC be a triangle with BC=aBC=a, AC=bAC=b, AB=cAB=c and a<b<ca<b<c. Denote by ma,mb,mcm_{a}, m_{b}, m_{c} the lengths of medians drawn from the vertices A,B,CA, B, C respectively. Using the formulas
4ma2=2(b2+c2)a2,4mb2=2(a2+c2)b2,4mc2=2(a2+b2)c2 4 m_{a}^{2} = 2(b^{2} + c^{2}) - a^{2}, \quad 4 m_{b}^{2} = 2(a^{2} + c^{2}) - b^{2}, \quad 4 m_{c}^{2} = 2(a^{2} + b^{2}) - c^{2}
we obtain the relations
4ma2+4mb2+4mc2=3a2+3b2+3c2(4ma2)2+(4mb2)2+(4mc2)2=(2b2+2c2a2)2+(2a2+2c2b2)2+(2a2+2b2c2)2=9a4+9b4+9c4=(3a2)2+(3b2)2+(3c2)2 \begin{gathered} 4 m_{a}^{2} + 4 m_{b}^{2} + 4 m_{c}^{2} = 3a^{2} + 3b^{2} + 3c^{2} \\ \left(4 m_{a}^{2}\right)^{2} + \left(4 m_{b}^{2}\right)^{2} + \left(4 m_{c}^{2}\right)^{2} = \left(2b^{2} + 2c^{2} - a^{2}\right)^{2} + \\ \left(2a^{2} + 2c^{2} - b^{2}\right)^{2} + \left(2a^{2} + 2b^{2} - c^{2}\right)^{2} = 9a^{4} + 9b^{4} + 9c^{4} = \\ \left(3a^{2}\right)^{2} + \left(3b^{2}\right)^{2} + \left(3c^{2}\right)^{2} \end{gathered}
We put A={4ma2,4mb2,4mc2}A=\{4 m_{a}^{2}, 4 m_{b}^{2}, 4 m_{c}^{2}\} and B={3a2,3b2,3c2}B=\{3a^{2}, 3b^{2}, 3c^{2}\}. Let k1k \geq 1 be a positive integer. Let a=k+1a = k+1, b=k+2b = k+2 and c=k+3c = k+3. Because
a+b=(k+1)+(k+2)=2k+3>k+3=c a+b = (k+1) + (k+2) = 2k+3 > k+3 = c
a triangle with such side lengths exists. After simple calculations we have
A={3(k+1)22, 3(k+2)2+4, 3(k+3)22}B={3(k+1)2, 3(k+2)2, 3(k+3)2} \begin{gathered} A = \{3(k+1)^{2} - 2,\ 3(k+2)^{2} + 4,\ 3(k+3)^{2} - 2\} \\ B = \{3(k+1)^{2},\ 3(k+2)^{2},\ 3(k+3)^{2}\} \end{gathered}
It is easy to prove that
x+y+z=m+n+p=3[(k+1)2+(k+2)2+(k+3)2]x2+y2+z2=m2+n2+p2=9[(k+1)4+(k+2)4+(k+3)4] \begin{gathered} x + y + z = m + n + p = 3\left[(k+1)^{2} + (k+2)^{2} + (k+3)^{2}\right] \\ x^{2} + y^{2} + z^{2} = m^{2} + n^{2} + p^{2} = 9\left[(k+1)^{4} + (k+2)^{4} + (k+3)^{4}\right] \end{gathered}
From the inequality 3(k+1)22>20033(k+1)^{2} - 2 > 2003 we obtain k25k \geq 25. For k=25k=25 we have an example of two sets
A={2026,2191,2350},B={2028,2187,2352} A = \{2026, 2191, 2350\}, \quad B = \{2028, 2187, 2352\}
with the desired properties.

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.