Determine positive integers x, y, z which satisfy the system x+y+zxyz=xy+yz+zx=1. and have the least possible sum.
Solution
First solution We write the system in the form xy+yz+zx=x+y+z(1) xyz=1.(2) Subtracting the two equations by parts we find ⇔⇔⇔⇔⇔xyz−(xy+yz+zx)=1−(x+y+z)xyz−xy−yz−zx+x+y+z−1=0xy(z−1)−x(z−1)−y(z−1)+(z−1)=0(z−1)(xy−x−y+1)=0(z−1)(x−1)(y−1)=0x=1 or y=1 or z=1. For x=1, from (1) and (2) we have yz=1, which have the solutions (y,z)=(a,a1),a>0, and so, the solutions of the system are (x,y,z)=(1,a,a1),a>0. Similarly, considering y=1 or z=1 we find the solutions (x,y,z)=(a,1,a1) or (x,y,z)=(a,a1,1),a>0. Since for each a>0 we have x+y+z=1+a+a1≥1+2=3. Equality holds for a=1, it follows that between the solutions of the system, the (x,y,z)=(1,1,1) is that having the least possible sum x+y+z.
Second solution Let (x,y,z) is the solution of the system with the least possible sum. Then, from the inequality of arithmetic – geometric mean we have 3x+y+z≥3xyz⇒x+y+z≥3, while equality holds for x=y=z. Hence the least possible value of the sum x+y+z, between the solution of the given system is 3 and it happens for x=y=z. For x=y=z, from the equation xyz=1, x,y,z>0, it follows that x=y=z=1, which satisfies also the equation x+y+z=xy+yz+zx.
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.