Olympiad Maths Prep

Track / Stage 7 / 288 of 300 #1688 of 2000

Problem 1688

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.9 Prove it

Show that the following equation has finitely many solutions (t,A,x,y,z)(t,A,x,y,z) in positive integers
t(1A2)(1x2)(1y2)(1z2)=(1+x1)(1+y1)(1+z1)\sqrt{t(1-A^{-2})(1-x^{-2})(1-y^{-2})(1-z^{-2})}=(1+x^{-1})(1+y^{-1})(1+z^{-1})

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. Rearrange the given equation:
t(1A2)(1x2)(1y2)(1z2)=(1+x1)(1+y1)(1+z1) \sqrt{t(1-A^{-2})(1-x^{-2})(1-y^{-2})(1-z^{-2})} = (1+x^{-1})(1+y^{-1})(1+z^{-1})
Squaring both sides, we get:
t(1A2)(1x2)(1y2)(1z2)=((1+x1)(1+y1)(1+z1))2 t(1-A^{-2})(1-x^{-2})(1-y^{-2})(1-z^{-2}) = \left( (1+x^{-1})(1+y^{-1})(1+z^{-1}) \right)^2
Simplifying the right-hand side:
((1+x1)(1+y1)(1+z1))2=(x+1xy+1yz+1z)2=(x+1)2(y+1)2(z+1)2x2y2z2 \left( (1+x^{-1})(1+y^{-1})(1+z^{-1}) \right)^2 = \left( \frac{x+1}{x} \cdot \frac{y+1}{y} \cdot \frac{z+1}{z} \right)^2 = \frac{(x+1)^2 (y+1)^2 (z+1)^2}{x^2 y^2 z^2}
Therefore, the equation becomes:
t(1A2)(1x2)(1y2)(1z2)=(x+1)2(y+1)2(z+1)2x2y2z2 t(1-A^{-2})(1-x^{-2})(1-y^{-2})(1-z^{-2}) = \frac{(x+1)^2 (y+1)^2 (z+1)^2}{x^2 y^2 z^2}
Rearranging, we get:
t(1A2)=(x+1)(y+1)(z+1)(x1)(y1)(z1) t(1-A^{-2}) = \frac{(x+1)(y+1)(z+1)}{(x-1)(y-1)(z-1)}
Define:
f(x,y,z)=(x+1)(y+1)(z+1)(x1)(y1)(z1) f(x,y,z) = \frac{(x+1)(y+1)(z+1)}{(x-1)(y-1)(z-1)}

2. Assume for contradiction that there are infinitely many solutions:
We need to show that t36 t \leq 36 .

3. **Bounding t t :**
- Note that A=1 A = 1 does not yield any solutions, and neither does x=1 x = 1 , y=1 y = 1 , or z=1 z = 1 .
- Therefore, 1A234 1 - A^{-2} \geq \frac{3}{4} .
- Since f(x,y,z) f(x,y,z) is decreasing in all of x,y,z x, y, z , we have:
f(x,y,z)f(2,2,2)=(2+1)3(21)3=27 f(x,y,z) \leq f(2,2,2) = \frac{(2+1)^3}{(2-1)^3} = 27
- Combining these, we get:
t2734=36 t \leq \frac{27}{\frac{3}{4}} = 36

4. **Fix t=T t = T :**
Since t t is bounded, there exists some T T such that there are infinitely many solutions to the original equation with t=T t = T .

5. **Finitely many solutions for fixed A A :**
Since f(x,y,z) f(x,y,z) is decreasing in each of x,y,z x, y, z , there are only finitely many solutions for a fixed A A . Consequently, there are solutions for infinitely many values of A A .

6. **Bounding the median of x,y,z x, y, z :**
- Without loss of generality, assume xyz x \geq y \geq z .
- Suppose infinitely many solutions satisfy yN y \leq N for some large integer N N .
- Then there exist y0,z0 y_0, z_0 such that there are infinitely many solutions with y=y0 y = y_0 and z=z0 z = z_0 .
- Since f(x,y0,z0) f(x, y_0, z_0) is decreasing in x x and T(1A2) T(1 - A^{-2}) is increasing in A A , there can be at most one solution, which is a contradiction.

7. **Bounding f(x,y,z) f(x, y, z) :**
- For all other solutions, taking N N large enough, we can note that:
f(x,y,z)f(N,N,z)(N+1N1)2z+1z1<c f(x, y, z) \leq f(N, N, z) \leq \left( \frac{N+1}{N-1} \right)^2 \cdot \frac{z+1}{z-1} < c
for some fixed constant c<1 c < 1 .

8. Combining the results:
- Adding back in the finitely many solutions that were disregarded, there is a constant C<1 C < 1 such that f(x,y,z)<C f(x, y, z) < C for all solutions (T,A,x,y,z) (T, A, x, y, z) .
- However, there must be solutions for infinitely many A A , and:
T(1A2)=f(x,y,z)<C T(1 - A^{-2}) = f(x, y, z) < C
fails for large enough A A , which is a contradiction.

Thus, there can only be finitely many solutions to the equation, as desired.

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