1. **Expressing a, b, and c in terms of relatively prime integers:**
Let
a=ℓk,b=nm,c=kmℓn
where gcd(k,ℓ)=gcd(m,n)=1. Given abc=1, we have:
ℓk⋅nm⋅kmℓn=1
which is true by construction.
2. Formulating the given condition:
We are given that there exist positive integers x,y,z such that ax+by+cz is an integer. Substituting the expressions for a, b, and c, we get:
(ℓk)x+(nm)y+(kmℓn)z∈Z
Simplifying, we have:
ℓxkx+nymy+(km)z(ℓn)z∈Z
3. Clearing the denominators:
Multiply through by ℓxny(km)z to clear the denominators:
ℓxkxℓxny(km)z+nymyℓxny(km)z+(km)z(ℓn)zℓxny(km)z∈Z
Simplifying, we get:
kxmzny+kzℓxmy+z+ℓx+zny+z∈Z
Dividing by kzℓxmzny, we have:
kzℓxmznykx+zmzny+kzℓxmy+z+ℓx+zny+z∈Z
4. Analyzing divisibility conditions:
For the above expression to be an integer, the numerator must be divisible by the denominator. This implies:
kz∣ℓx+zny+z
Since gcd(k,ℓ)=1, it follows that:
kz∣ny+z
Similarly, we obtain the following divisibility conditions:
mz∣ℓx+z(2)
ℓx∣mzny(3)
ny∣kzℓx(4)
5. Handling common prime factors:
Consider a prime p that divides both ℓ and n. Suppose:
pα∣∣ℓ,pβ∣∣n
From (3), we have:
αx≤βy
From (4), we have:
βy≤αx
Thus, αx=βy. This implies there exist positive integers s and t such that:
ℓ=ℓ′⋅s,n=n′⋅t,ty=sx,gcd(ℓ′,n′)=1
6. Prime factorization and divisibility:
Using the modified versions of (2) and (3), we get:
(ℓ′)x∣mzandmz∣(ℓ′)x+z
This implies ℓ′ and m have the same set of prime divisors. Let:
ℓ′=j=1∏Npjαj,m=j=1∏Npjβj
We analyze the νp values for each term in the numerator and denominator.
7. Conclusion:
By analyzing the νp values and ensuring the conditions hold, we conclude that a, b, and c must be powerful. Specifically, m and ℓ′ must be nontrivial perfect powers, and similar arguments apply to k and n′.