Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 3"
m |
|||
(4 intermediate revisions by 2 users 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== | ||
− | |||
− | ---- | + | If <math>n^2 + 12n - 2007 = m^2</math>, we can [[completing the square | complete the square]] on the left-hand side to get <math>n^2 + 12n + 36 = m^2 + 2043</math> so <math>(n+6)^2 = m^2 + 2043</math>. Subtracting <math>m^2</math> and [[factoring]] the left-hand side, we get <math>(n + m + 6)(n - m + 6) = 2043</math>. <math>2043 = 3^2 \cdot 227</math>, which can be split into two [[factor]]s in 3 ways, <math>2043 \cdot 1 = 3 \cdot 681 = 227 \cdot 9</math>. This gives us three pairs of [[equation]]s to solve for <math>n</math>: |
− | + | <math>n + m + 6 = 2043</math> and <math>n - m + 6 = 1</math> give <math>2n + 12 = 2044</math> and <math>n = 1016</math>. | |
− | + | <math>n + m + 6 = 681</math> and <math>n - m + 6 = 3</math> give <math>2n + 12 = 684</math> and <math>n = 336</math>. | |
− | + | <math>n + m + 6 = 227</math> and <math>n - m + 6 = 9</math> give <math>2n + 12 = 236</math> and <math>n = 112</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]] |
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 |