Difference between revisions of "2006 AIME A Problems/Problem 2"
(→Problem) |
(→Solution) |
||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | + | The smallest <math>S</math> is <math>1+2+ \ldots +90 = 91 \cdot 45 = 4095</math>. The largest <math>S</math> is <math>11+12+ \ldots +100=111\cdot 45=4995</math>. All numbers between <math>4095</math> and <math>4995</math> are possible values of S, so the number of possible values of S is <math>4995-4095+1=901</math>. | |
− | |||
− | <math> | ||
− | |||
− | <math>\ | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | <math> | ||
− | |||
− | <math> | ||
− | |||
− | <math> | ||
− | |||
− | |||
− | |||
− | <math> | ||
− | |||
− | |||
== See also == | == See also == |