Maths Olympiad Prep

Track / Stage 6 / 71 of 400 #1711 of 2604

Problem 1711

National Olympiad, first round
Number theory Difficulty 6.0 Prove it Bulgarian Mathematical Olympiad · Bulgaria

Let aa, bb and cc be positive integers such that one of them is coprime with any of the other two. Prove that there are positive integers xx, yy and zz such that xa=yb+zcx^{a} = y^{b} + z^{c}.

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.

Next problem →

Official solution

Solution:
We consider two cases.

Case 1. Let (a,b)=(a,c)=1(a, b) = (a, c) = 1. Then (a,bc)=1(a, b c) = 1 and hence there are integers uu and vv such that ua+vbc=1u a + v b c = 1. This means that aa divides −vbc+1-v b c + 1. If k≥1k \geq 1 is a positive integer such that aa divides −v−k-v - k, then aa divides kbc+1k b c + 1, i.e. kbc+1=atk b c + 1 = a t. Hence setting x=2tx = 2^{t}, y=2kcy = 2^{k c} and z=2kbz = 2^{k b} we have that
yb+zc=2kbc+2kbc=2kbc+1=(2t)a=xa y^{b} + z^{c} = 2^{k b c} + 2^{k b c} = 2^{k b c + 1} = \left(2^{t}\right)^{a} = x^{a}

Case 2. Let (c,a)=(c,b)=1(c, a) = (c, b) = 1. Then (c,ab)=1(c, a b) = 1 and as above we find a positive integer kk such that cc divides kab+1k a b + 1, i.e., kab+1=ctk a b + 1 = c t. Hence setting x=2(2a−1)kbx = 2\left(2^{a} - 1\right)^{k b}, y=(2a−1)kay = \left(2^{a} - 1\right)^{k a} and z=(2a−1)tz = \left(2^{a} - 1\right)^{t} one has that
xa−yb=2a(2a−1)kab−(2a−1)kab=(2a−1)kab+1=zc x^{a} - y^{b} = 2^{a}\left(2^{a} - 1\right)^{k a b} - \left(2^{a} - 1\right)^{k a b} = \left(2^{a} - 1\right)^{k a b + 1} = z^{c}

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.