Maths Olympiad Prep

Library / /47 of 133

Number theory Difficulty 5.4 AIME, harder Prove it Saudi Arabia

Find all triples (x,y,z)(x, y, z) of positive integers such that
3x+4y=5z 3^{x} + 4^{y} = 5^{z}

Solution

Looking mod4\bmod 4 we get (1)x(mod4)(-1)^{x} \equiv (\bmod 4), hence xx is even. Looking mod3\bmod 3 we get 1(1)z(mod3)1 \equiv (-1)^{z} (\bmod 3), hence zz is even. Let x=2mx = 2m, z=2nz = 2n. We have
4y=(5n3m)(5n+3m) 4^{y} = (5^{n} - 3^{m})(5^{n} + 3^{m})
hence 5n+3m=2a5^{n} + 3^{m} = 2^{a}, 5n3m=2b5^{n} - 3^{m} = 2^{b}, a+b=2ya + b = 2y, y>0y > 0. Then
23m=2a2b=2b(2ab1), 2 \cdot 3^{m} = 2^{a} - 2^{b} = 2^{b}(2^{a-b} - 1),
so b=1b = 1 and obtain
3m=2a11. 3^{m} = 2^{a-1} - 1.
Looking mod 3 it follows (1)a11(mod3)(-1)^{a-1} \equiv 1 (\bmod 3), hence a1a-1 is even. Let a1=2αa-1 = 2\alpha. We obtain
3m=22α1=(2α1)(2α+1), 3^{m} = 2^{2\alpha} - 1 = (2^{\alpha} - 1)(2^{\alpha} + 1),
and obtain
2α1=3t,2α+1=3s,t+s=m,t<s. 2^{\alpha} - 1 = 3^{t}, \quad 2^{\alpha} + 1 = 3^{s}, \quad t + s = m, \quad t < s.
We get
3s3t=2 3^{s} - 3^{t} = 2
or
3t(3st1)=2, 3^{t}(3^{s-t} - 1) = 2,
hence t=0t = 0, s=1s = 1, α=1\alpha = 1, a=3a = 3.
We get m=1m = 1, 5n=55^{n} = 5, so n=1n = 1. Finally, x=2x = 2, z=2z = 2, and y=2y = 2.

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.