Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 3"
m |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Let <math>\displaystyle S</math> be the sum of all positive integers <math>\displaystyle n</math> such that <math>\displaystyle n^2+12n-2007</math> is a perfect square. Find the remainder when <math>\displaystyle S</math> is divided by <math>\displaystyle 1000.</math> | Let <math>\displaystyle S</math> be the sum of all positive integers <math>\displaystyle n</math> such that <math>\displaystyle n^2+12n-2007</math> is a perfect square. Find the remainder when <math>\displaystyle S</math> is divided by <math>\displaystyle 1000.</math> | ||
| + | ==Solution== | ||
| + | {{solution}} | ||
| + | |||
| + | ---- | ||
| + | |||
| + | *[[Mock AIME 2 2006-2007/Problem 2 | Previous Problem]] | ||
| + | |||
| + | *[[Mock AIME 2 2006-2007/Problem 4 | Next Problem]] | ||
| + | |||
| + | *[[Mock AIME 2 2006-2007]] | ||
Revision as of 18:46, 22 August 2006
Problem
Let 
be the sum of all positive integers 
such that 
is a perfect square. Find the remainder when is divided by 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
