Find the number of ordered triples of nonnegative integers that satisfy .
Solution
The solutions are and up to permutation. First, we do the case where at least one of is 0. WLOG, say . Then we have . As 83 is prime, the only solution is up to permutation. Otherwise, we claim that at least one of is equal to 1. Otherwise, all are at least 2, so . So WLOG, set . We now need . Now, WLOG, say . If , then , which has no solution. If , then . So we need . Then we need . Solving this gives , for the solution . Therefore, the answer is .
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.