The function , for any , gives the number of unordered pairs of positive integers such that their product is times their sum. What is ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Begin with the equation x y = 2 0 1 3 x + 2 0 1 3 y . From this we obtain x ( y − 2 0 1 3 ) = 2 0 1 3 y ⇒ x = y − 2 0 1 3 2 0 1 3 y = 2 0 1 3 + y − 2 0 1 3 2 0 1 3 2 . Set k = y − 2 0 1 3 ; thus k is an integer. For x to be an integer, we must have that k 2 0 1 3 2 . Any k will determine a y and thus an x , so we only need to find the number of k s. However, this is just the number of divisors of 2 0 1 3 2 = 3 2 1 1 2 6 1 2 ⇒ ( 2 + 1 ) ( 2 + 1 ) ( 2 + 1 ) = 2 7 .