I'm trying to solve the problem of how many solutions (x,y) there are to:
for a fixed positive integer n and positive integers x and y.
I've been told that this equates to finding the # of divisors of minus the # of duplicate solutions, which in total equals (where is the divisor function).
My question is, what is the reasoning for being the number of duplicate solutions? Where does this come from?
Thanks a lot!