Browse · harp
Printsmc
counting and probability senior
Problem
The number of solution-pairs in the positive integers of the equation is:
(A)
(B)
(C)
(D)
Solution
We have . Thus, must be a positive multiple of . If , we find our first positive multiple of . From there, we note that will always return a multiple of for . Our first solution happens at . We now want to find the smallest multiple of that will work. If , then we have , or . When , the expression is equal to , and when , the expression is equal to , which will no longer work. Thus, all integers from to will generate an that will be a positive integer, and which will in turn generate a that is also a positive integer. So, the answer is .
Final answer
A