2018 AMC 10 B
Complete problem set with solutions and individual problem pages
How many ordered pairs of positive integers satisfy the equation lcm gcd, where gcd denotes the greatest common divisor of and , and lcm denotes their least common multiple? (2018 AMC 10B Problem, Question#23)
- A.
- B.
- C.
- D.
- E.
Let , and . Therefore, .Thus, the equation becomes
, Using Simon's Favorite Factoring Trick, we rewrite this equation as , , From here we can already see that this is a quadratic, and thus must have solutions. But, let's continue, to see if one of the solutions is extraneous.
Since and , we have and , or and . This gives us the solutions and . Since the Greatest Common Denominator must be a divisor of the Lowest Common Multiple, the first pair does not work. Assume . We must have and , and we could then have , so there are solutions.
