Number theoryDifficulty 4.8AIMEProve itUnited States
Problem: Show that there exist infinitely many triples of positive integers x,y,z which satisfy x999+y1000=z1001.
Solution
Solution: We will choose x, y, and z to be powers of 2 such that the terms x999 and y1000 are equal and z1001 is their sum. Writing x=2a, y=2b, z=2c, we have the conditions 999a=1000b=1001c−1. The first equation suggests that we try a=1000d, b=999d, which yields the equation 999000d=1001c−1. Since 999000=1001⋅998+2, we can rewrite this as 2d=1001(c−998d)−1. It is now clear that we can plug any odd positive integer 2k+1 for c−998d and get an integer for d, and hence for c. The results are as follows: abc=1000(1001k+500)=999(1001k+500)=999000k+499001.
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.