Maths Olympiad Prep

Library / /34 of 94

Number theory Difficulty 4.6 AIME Prove it United States

Problem:
Find the number of positive integer solutions to nx+ny=nzn^{x} + n^{y} = n^{z} with nz<2001n^{z} < 2001.

Solution

Solution:
If n=1n = 1, the relation can not hold, so assume otherwise. If x>yx > y, the left hand side factors as ny(nxy+1)n^{y}(n^{x-y} + 1) so nxy+1n^{x-y} + 1 is a power of nn. But it leaves a remainder of 1 when divided by nn and is greater than 1, a contradiction. We reach a similar contradiction if y>xy > x. So y=xy = x and 2nx=nz2 n^{x} = n^{z}, so 2 is a power of nn and n=2n = 2. So all solutions are of the form 2x+2x=2x+12^{x} + 2^{x} = 2^{x+1}, which holds for all xx. 2x+1<20012^{x+1} < 2001 implies x<11x < 11, so there are 10 solutions.

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.