Difference between revisions of "2002 AMC 12B Problems/Problem 13"
Coolmath2017 (talk | contribs) (→Solution 1) |
Coolmath2017 (talk | contribs) (→Solution 1) |
||
Line 9: | Line 9: | ||
== Solution == | == Solution == | ||
− | + | == Solution 1 == | |
+ | |||
+ | Let the first term be <math>x</math> and the common difference be <math>d.</math> | ||
+ | |||
+ | Thus, we know the sum of terms is <math>9(2x+17d).</math> | ||
+ | |||
+ | Because <math>9</math> is already a perfect square, we know that <math>2x+17d</math> must also be a perfect square. | ||
+ | |||
+ | Since we want the smallest value of the sum, we know that <math>25=2x+17 \rightarrow x=4</math> and <math>d=1.</math> | ||
+ | |||
+ | Thus, the answer is <math>9*25 = \boxed{225}.</math> | ||
== Solution 2 == | == Solution 2 == |
Revision as of 20:20, 31 August 2020
Problem
The sum of consecutive positive integers is a perfect square. The smallest possible value of this sum is
Solution
Solution 1
Let the first term be and the common difference be
Thus, we know the sum of terms is
Because is already a perfect square, we know that must also be a perfect square.
Since we want the smallest value of the sum, we know that and
Thus, the answer is
Solution 2
Let be the consecutive positive integers. Their sum, , is a perfect square. Since is a perfect square, it follows that is a perfect square. The smallest possible such perfect square is when , and the sum is .
Solution 2
Notice that all five choices given are perfect squares.
Let be the smallest number, we have
Subtract from each of the choices and then check its divisibility by , we have as the smallest possible sum.
~ Nafer
See also
2002 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 12 |
Followed by Problem 14 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.