Browse · harp
Printimc
number theory intermediate
Problem
How many ordered pairs of positive integers satisfy the equation where denotes the greatest common divisor of and , and denotes their least common multiple?
(A)
(B)
(C)
(D)
Solution
Let , and . Therefore, . Thus, the equation becomes Using Simon's Favorite Factoring Trick, we rewrite this equation as Since and , we have and , or and . This gives us the solutions and . Since the must be a divisor of the , the first pair does not work. Assume . We must have and , and we could then have , so there are solutions. (awesomeag) Edited by IronicNinja, Firebolt360, and mprincess0229~
Final answer
B