Find the number of positive integer solutions to nx+ny=nz with nz<2001.
A number or a short expression. Spacing and $ signs are ignored.
Solution
If n=1, the relation can not hold, so assume otherwise. If x>y, the left hand side factors as ny(nx−y+1) so nx−y+1 is a power of n. But it leaves a remainder of 1 when divided by n and is greater than 1, a contradiction. We reach a similar contradiction if y>x. So y=x and 2nx=nz, so 2 is a power of n and n=2. So all solutions are of the form 2x+2x=2x+1, which holds for all x. 2x+1<2001 implies x<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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.