Difference between revisions of "1999 AIME Problems/Problem 3"
(→Solution 3) |
m (Note: I'm postbanned so I can't post in the site support thread, but I fixed it.) |
||
(5 intermediate revisions by 5 users not shown) | |||
Line 1: | Line 1: | ||
− | == Problem == | + | == Problem == |
Find the sum of all [[positive integer]]s <math>n</math> for which <math>n^2-19n+99</math> is a [[perfect square]]. | Find the sum of all [[positive integer]]s <math>n</math> for which <math>n^2-19n+99</math> is a [[perfect square]]. | ||
Latest revision as of 00:18, 29 January 2021
Problem
Find the sum of all positive integers for which is a perfect square.
Solution 1
If for some positive integer , then rearranging we get . Now from the quadratic formula,
Because is an integer, this means for some nonnegative integer . Rearranging gives . Thus or , giving or . This gives or , and the sum is .
Solution 2
Suppose there is some such that . Completing the square, we have that , that is, . Multiplying both sides by 4 and rearranging, we see that . Thus, . We then proceed as we did in the previous solution.
Solution 3
When , we have
So if and is a perfect square, then
or .
For , it is easy to check that is a perfect square when and ( using the identity
We conclude that the answer is
See also
1999 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.