Maths Olympiad Prep

Track / Stage 8 / 17 of 180 #1717 of 1964

Problem 1717

IMO Shortlist mid-range; USAMO P2/P5
Number theory Difficulty 8.0 Prove it

Call a rational number rr [i]powerful[/i] if rr can be expressed in the form pkq\dfrac{p^k}{q} for some relatively prime positive integers p,qp, q and some integer k>1k >1. Let a,b,ca, b, c be positive rational numbers such that abc=1abc = 1. Suppose there exist positive integers x,y,zx, y, z such that ax+by+cza^x + b^y + c^z is an integer. Prove that a,b,ca, b, c are all [i]powerful[/i].

[i]Jeck Lim, Singapore[/i]

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

1. **Expressing aa, bb, and cc in terms of relatively prime integers:**
Let
a=k,b=mn,c=nkm a = \frac{k}{\ell}, \quad b = \frac{m}{n}, \quad c = \frac{\ell n}{km}
where gcd(k,)=gcd(m,n)=1\gcd(k, \ell) = \gcd(m, n) = 1. Given abc=1abc = 1, we have:
kmnnkm=1 \frac{k}{\ell} \cdot \frac{m}{n} \cdot \frac{\ell n}{km} = 1
which is true by construction.

2. Formulating the given condition:
We are given that there exist positive integers x,y,zx, y, z such that ax+by+cza^x + b^y + c^z is an integer. Substituting the expressions for aa, bb, and cc, we get:
(k)x+(mn)y+(nkm)zZ \left(\frac{k}{\ell}\right)^x + \left(\frac{m}{n}\right)^y + \left(\frac{\ell n}{km}\right)^z \in \mathbb{Z}
Simplifying, we have:
kxx+myny+(n)z(km)zZ \frac{k^x}{\ell^x} + \frac{m^y}{n^y} + \frac{(\ell n)^z}{(km)^z} \in \mathbb{Z}

3. Clearing the denominators:
Multiply through by xny(km)z\ell^x n^y (km)^z to clear the denominators:
kxxny(km)zx+myxny(km)zny+(n)zxny(km)z(km)zZ \frac{k^x \ell^x n^y (km)^z}{\ell^x} + \frac{m^y \ell^x n^y (km)^z}{n^y} + \frac{(\ell n)^z \ell^x n^y (km)^z}{(km)^z} \in \mathbb{Z}
Simplifying, we get:
kxmzny+kzxmy+z+x+zny+zZ k^x m^z n^y + k^z \ell^x m^{y+z} + \ell^{x+z} n^{y+z} \in \mathbb{Z}
Dividing by kzxmznyk^z \ell^x m^z n^y, we have:
kx+zmzny+kzxmy+z+x+zny+zkzxmznyZ \frac{k^{x+z} m^z n^y + k^z \ell^x m^{y+z} + \ell^{x+z} n^{y+z}}{k^z \ell^x m^z n^y} \in \mathbb{Z}

4. Analyzing divisibility conditions:
For the above expression to be an integer, the numerator must be divisible by the denominator. This implies:
kzx+zny+z k^z \mid \ell^{x+z} n^{y+z}
Since gcd(k,)=1\gcd(k, \ell) = 1, it follows that:
kzny+z k^z \mid n^{y+z}
Similarly, we obtain the following divisibility conditions:
mzx+z(2) m^z \mid \ell^{x+z} \quad (2)
xmzny(3) \ell^x \mid m^z n^y \quad (3)
nykzx(4) n^y \mid k^z \ell^x \quad (4)

5. Handling common prime factors:
Consider a prime pp that divides both \ell and nn. Suppose:
pα,pβn p^\alpha \mid \mid \ell, \quad p^\beta \mid \mid n
From (3), we have:
αxβy \alpha x \leq \beta y
From (4), we have:
βyαx \beta y \leq \alpha x
Thus, αx=βy\alpha x = \beta y. This implies there exist positive integers ss and tt such that:
=s,n=nt,ty=sx,gcd(,n)=1 \ell = \ell' \cdot s, \quad n = n' \cdot t, \quad t^y = s^x, \quad \gcd(\ell', n') = 1

6. Prime factorization and divisibility:
Using the modified versions of (2) and (3), we get:
()xmzandmz()x+z (\ell')^x \mid m^z \quad \text{and} \quad m^z \mid (\ell')^{x+z}
This implies \ell' and mm have the same set of prime divisors. Let:
=j=1Npjαj,m=j=1Npjβj \ell' = \prod_{j=1}^N p_j^{\alpha_j}, \quad m = \prod_{j=1}^N p_j^{\beta_j}
We analyze the νp\nu_p values for each term in the numerator and denominator.

7. Conclusion:
By analyzing the νp\nu_p values and ensuring the conditions hold, we conclude that aa, bb, and cc must be powerful. Specifically, mm and \ell' must be nontrivial perfect powers, and similar arguments apply to kk and nn'.

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