Maths Olympiad Prep

Track / Stage 6 / 300 of 400 #1300 of 1964

Problem 1300

National olympiad, first round
Combinatorics Difficulty 6.6 Prove it

7. For positive integers m,nm, n, let f(m,n)f(m, n) denote the number of ordered integer triples (x,y,z)(x, y, z) satisfying
{xyz=x+y+z+m,max{x,y,z}n \left\{\begin{array}{l} x y z = x + y + z + m, \\ \max \{|x|,|y|,|z|\} \leqslant n \end{array}\right.

Does there exist positive integers m,nm, n such that f(m,n)=2018f(m, n) = 2018? Prove your conclusion.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

7. Suppose positive integers m,nm, n satisfy
f(m,n)=2018f(m, n)=2018.
For the integer solutions (x,y,z)(x, y, z) of the system of equations (1):
if x=y=zx=y=z, then it is called the 1st type solution;
if exactly two of x,y,zx, y, z are equal, then it is called the 2nd type solution;
if x,y,zx, y, z are all distinct, then it is called the 3rd type solution.
Let the number of the ii-th type solution be aia_{i}.
Since the integer solutions (x,y,z)(x, y, z) of the system of equations (1) remain solutions after permuting the components, we have
3a2,6a33\left|a_{2}, 6\right| a_{3}.
Thus, a1=a1+a2+a3=20182(mod3)a_{1}=a_{1}+a_{2}+a_{3}=2018 \equiv 2(\bmod 3).
This indicates that the number of integer roots of the equation
x33xm=0x^{3}-3 x-m=0

satisfying xn|x| \leqslant n is congruent to 2 modulo 3. Hence, it has at least two integer roots, denoted as α,β\alpha, \beta.

By the properties of cubic equations, the third root of equation (2) is a real number, denoted as γ\gamma. According to Vieta's formulas, we have
α+β+γ=0,{ }^{\alpha+\beta+\gamma=0,}
{αβ+βγ+γα=3,αβγ=m.\left\{\begin{array}{l}\alpha \beta+\beta \gamma+\gamma \alpha=-3, \\ \alpha \beta \gamma=m .\end{array}\right.
Thus, γ=αβZ\gamma=-\alpha-\beta \in \mathbf{Z}.
Assume αβγ\alpha \leqslant \beta \leqslant \gamma.
From αβγ=m>0\alpha \beta \gamma=m>0, we know αβ<0<γ\alpha \leqslant \beta<0<\gamma.
Then 3=αβ+(α+β)(αβ)-3=\alpha \beta+(\alpha+\beta)(-\alpha-\beta)
=α2αββ23=-\alpha^{2}-\alpha \beta-\beta^{2} \leqslant-3.
This implies α=β=1\alpha=\beta=-1.
Thus, γ=2,m=2\gamma=2, m=2.
Next, consider the system of equations (1) under m=2m=2.
Notice that, (2n+1)32018(2 n+1)^{3} \geqslant 2018 (there are only (2n+1)3(2 n+1)^{3}

integer triples (x,y,z)(x, y, z) satisfying xyz|x| 、|y| 、|z| are all no greater than nn).
Thus, n6n \geqslant 6.
Next, calculate a1a2a3a_{1} 、 a_{2} 、 a_{3}.
(1) Since 1,2-1,2 are all integer solutions of x33x2=0x^{3}-3 x-2=0, the triples
(1,1,1)(2,2,2)(-1,-1,-1) 、(2,2,2) are all the 1st type solutions of the system of equations (1), i.e., a1=2a_{1}=2.
(2) For the 2nd type solutions, assume y=zxy=z \neq x, substituting into

the system of equations (1) gives
xy2=x+2y+2x y^{2}=x+2 y+2
(y+1)(x(y1)2)=0\Rightarrow(y+1)(x(y-1)-2)=0.
When y=1y=-1, (x,1,1)(nxn(x,-1,-1)(-n \leqslant x \leqslant n,
x1)x \neq-1) are 2n2 n 2nd type solutions;
When y1y \neq-1, from x(y1)=2x(y-1)=2, we have
{x=±2,±1,y1=±1,±2\left\{\begin{array}{l}x= \pm 2, \pm 1, \\ y-1= \pm 1, \pm 2\end{array}\right.
Noting that xyx \neq y, we have
(x,y)=(2,0),(1,3)(x, y)=(-2,0),(1,3)

satisfying the conditions.
Considering the permutations of x,y,zx, y, z, the number of 2nd type solutions
a2=3(2n+2)a_{2}=3(2 n+2).
(3) For the 3rd type solutions (x,y,z)(x, y, z), consider the number of the corresponding 3-element sets {x,y,z}\{x, y, z\}.

First, 1{x,y,z}-1 \notin\{x, y, z\} (otherwise, assume z=1z=-1, substituting into the system of equations (1) and rearranging gives
(x+1)(y+1)=01{x,y}(x+1)(y+1)=0 \Rightarrow-1 \in\{x, y\},

contradicting that x,y,zx, y, z are all distinct).
If 0{x,y,z}0 \in\{x, y, z\}, assume z=0z=0, substituting into the system of equations (1) gives x+y=2x+y=-2. Then
{x,y,z}={k,2k,0}(k=1,2,,n2)\{x, y, z\}=\{k,-2-k, 0\}(k=1,2, \cdots, n-2)

are n2n-2 3-element sets.
If 0{x,y,z}0 \notin\{x, y, z\}, assume yzy 、 z have the same sign, and
yz|y| \geqslant|z|.
When z=1|z|=1, we must have z=1z=1, substituting into the system of equations (1) and rearranging gives
(x1)(y1)=4(x-1)(y-1)=4.
Noting that xy,xy0x \neq y, x y \neq 0, we have
(x,y)=(5,2),(2,5)(x, y)=(5,2),(2,5)

satisfying the conditions. Thus,
{x,y,z}={1,2,5}\{x, y, z\}=\{1,2,5\}.
When z2|z| \geqslant 2, from x=y+z+2yz1x=\frac{y+z+2}{y z-1}, we have
xy+z+2yz12y+22y1|x| \leqslant \frac{|y|+|z|+2}{|y||z|-1} \leqslant \frac{2|y|+2}{2|y|-1}
=1+32y12=1+\frac{3}{2|y|-1} \leqslant 2.
The equality cannot hold simultaneously (otherwise, we must have x=y=z=2|x|=|y|=|z|=2, and (x,y,z)(x, y, z) would not be a 3rd type solution), thus, x<2,x=1|x|<2, x=1.
This implies, {x,y,z}={1,2,5}\{x, y, z\}=\{1,2,5\}.
Therefore, the 3-element sets {x,y,z}\{x, y, z\} corresponding to the 3rd type solutions of the system of equations (1) are n1n-1.
Thus, a3=6(n1)a_{3}=6(n-1).
Combining (1), (2), and (3), we have for any n6n \geqslant 6,
a1+a2+a3a_{1}+a_{2}+a_{3}
=2+3(2n+2)+6(n1)=2+3(2 n+2)+6(n-1)
=12n+2=12 n+2.
Since a1+a2+a3=f(m,n)=2018a_{1}+a_{2}+a_{3}=f(m, n)=2018, we have
n=168n=168.

In summary, when and only when m=2,n=168m=2, n=168,

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.