Maths Olympiad Prep

Library / /12 of 224

Number theory Difficulty 4.9 AIME Prove it Belarus

Find all triples of positive integers (x,y,z)(x, y, z) satisfying the equality 3x+7y=4z3^x + 7^y = 4^z.

Solution

z3z \ge 3, then 2z132^z - 1 \vdash 3, but it is possible only if zz is even. Let z=2cz = 2c for some nonnegative integer cc. Then 4c3a=14^c - 3^a = 1. If a=1a = 1, we find c=1c = 1 and obtain x=1,z=2,y=1x = 1, z = 2, y = 1. If a>1a > 1, then 4c=3a+14^c = 3^a + 1 has remainder 1 when divided by 9. The power of 4 has this remainder only if cc is divisible by 3. But in this case 431(mod7)4^3 \equiv 1 \pmod 7 and hence 4c1(mod7)4^c \equiv 1 \pmod 7. It follows that 3a=4c173^a = 4^c - 1 \vdash 7, which is impossible.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.