Mock AIME 2 2006-2007 Problems/Problem 3
Revision as of 14:28, 3 April 2012 by 1=2 (talk | contribs) (moved Mock AIME 2 2006-2007/Problem 3 to Mock AIME 2 2006-2007 Problems/Problem 3)
Problem
Let be the sum of all positive integers such that is a perfect square. Find the remainder when is divided by
Solution
If , we can complete the square on the left-hand side to get so . Subtracting and factoring the left-hand side, we get . , which can be split into two factors in 3 ways, . This gives us three pairs of equations to solve for :
and give and .
and give and .
and give and .
Finally, , so the answer is .