Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 3"
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Let <math> | + | Let <math>S</math> be the sum of all [[positive integer]]s <math>n</math> such that <math>n^2+12n-2007</math> is a [[perfect square]]. Find the [[remainder]] when <math>S</math> is divided by <math>1000.</math> |
==Solution== | ==Solution== | ||
Line 13: | Line 13: | ||
Finally, <math>1016 + 336 + 112 = 1464</math>, so the answer is <math>464</math>. | Finally, <math>1016 + 336 + 112 = 1464</math>, so the answer is <math>464</math>. | ||
− | + | ==See Also== | |
− | + | {{Mock AIME box|year=2006-2007|n=2|num-b=2|num-a=4}} | |
− | |||
− | |||
− | |||
− | |||
− | |||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] |
Latest revision as of 09:50, 4 April 2012
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 .
See Also
Mock AIME 2 2006-2007 (Problems, Source) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |