Maths Olympiad Prep

Library / /16 of 25

, 2008

Number theory Difficulty 6.0 National olympiad Prove it Ukraine

Find out how many solutions may equation
[a2,b2]+[b2,c2]+[c2,a2]=(a2,b2)(b2,c2)(c2,a2) [a^2, b^2] + [b^2, c^2] + [c^2, a^2] = (a^2, b^2)(b^2, c^2)(c^2, a^2)
have in natural numbers, if [m,n][m, n] and (m,n)(m, n) stands respectively for the LCM and GCD of the natural numbers mm and nn.

Solution

Let a=pxa = px, b=pyb = py, c=pzc = pz where pp, xx, yy, zz are pairwise coprime numbers. Then the equation will be as follows: (pxy)2+(pxz)2+(pyz)2=(p2)3x2y2+x2z2+y2z2=p4(pxy)^2 + (pxz)^2 + (pyz)^2 = (p^2)^3 \Leftrightarrow x^2y^2 + x^2z^2 + y^2z^2 = p^4
x2(y2+z2)=(p2yz)(p2+yz). \Leftrightarrow x^2(y^2 + z^2) = (p^2 - yz)(p^2 + yz).
If p2=y2+yz+z2p^2 = y^2 + yz + z^2, x2(y2+z2)=(y2+2yz+z2)(y2+z2)x=y+zx^2(y^2 + z^2) = (y^2 + 2yz + z^2)(y^2 + z^2) \Rightarrow x = y + z. Under such conditions the solution will be the following set of three (p(y+z),py,pz)(p(y+z), py, pz).
We just have to show that there are infinitely many sets of three natural numbers (p,y,z)(p, y, z) for which p2=y2+yz+z2p^2 = y^2 + yz + z^2 is true. Let's denote u=ypu = \frac{y}{p}, v=zpv = \frac{z}{p}, i.e. we have to show that equation u2+uv+v2=1u^2 + uv + v^2 = 1 has infinitely many solutions in rational coordinates. One point is (1,0)(1, 0). Let's choose rational number kk, then besides (1,0)(1, 0) line v=k(u1)v = k(u-1) intersects curve (ellipse) u2+uv+v2=1u^2 + uv + v^2 = 1 at one more point. According to the Vieta theorem this point is rational.

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.