Find the number of ordered pairs of integers such that are divisors of but is not.
Problem 1255
Official solution
Solution:
First consider the case . We have , so the number of divisors of is . We consider the number of ways to select an ordered pair such that all divide . Using the balls and urns method on each of the prime factors, we find the number of ways to distribute the factors of across and is , the factors of is , the factors of is . So the total number of ways to select with all dividing is . The number of ways to select any with and dividing is , so there are ways to select and such that divide but doesn't.
Now, each corresponds to four solutions () giving the final answer of . (Note that .)