Maths Olympiad Prep

Library / /7 of 20

Number theory Difficulty 4.8 AIME Prove it United States

Problem:
Show that there exist infinitely many triples of positive integers x,y,zx, y, z which satisfy x999+y1000=z1001x^{999} + y^{1000} = z^{1001}.

Solution

Solution:
We will choose xx, yy, and zz to be powers of 22 such that the terms x999x^{999} and y1000y^{1000} are equal and z1001z^{1001} is their sum. Writing x=2ax = 2^{a}, y=2by = 2^{b}, z=2cz = 2^{c}, we have the conditions
999a=1000b=1001c1. 999a = 1000b = 1001c - 1.
The first equation suggests that we try a=1000da = 1000d, b=999db = 999d, which yields the equation
999000d=1001c1. 999000d = 1001c - 1.
Since 999000=1001998+2999000 = 1001 \cdot 998 + 2, we can rewrite this as
2d=1001(c998d)1. 2d = 1001(c - 998d) - 1.
It is now clear that we can plug any odd positive integer 2k+12k + 1 for c998dc - 998d and get an integer for dd, and hence for cc. The results are as follows:
a=1000(1001k+500)b=999(1001k+500)c=999000k+499001. \begin{aligned} a & = 1000(1001k + 500) \\ b & = 999(1001k + 500) \\ c & = 999000k + 499001. \end{aligned}

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.