Difference between revisions of "2002 AIME II Problems/Problem 7"
I like pie (talk | contribs) m |
I like pie (talk | contribs) (Added problem, solution still needed) |
||
Line 1: | Line 1: | ||
− | |||
== Problem == | == Problem == | ||
+ | It is known that, for all positive integers <math>k</math>, | ||
+ | <center><math>1^2+2^2+3^2+\ldots+k^{2}=\frac{k(k+1)(2k+1)}6</math>.</center> | ||
+ | Find the smallest positive integer <math>k</math> such that <math>1^2+2^2+3^2+\ldots+k^2</math> is a multiple of <math>200</math>. | ||
== Solution == | == Solution == |
Revision as of 13:07, 19 April 2008
Problem
It is known that, for all positive integers ,
Find the smallest positive integer such that is a multiple of .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
2002 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |