Difference between revisions of "2007 AIME I Problems/Problem 11"
(→Solution: correct solution (avg of 44^2 and 45^2 is -> 1981), fmt) |
m (fmt-ting) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | For each [[positive]] [[integer]] <math>p</math>, let <math>b(p)</math> denote the unique positive integer <math>k</math> such that <math>|k-\sqrt{p}| < \frac{1}{2}</math>. For example, <math>b(6) = 2</math> and <math>b(23) = 5</math>. If <math>S = \ | + | For each [[positive]] [[integer]] <math>p</math>, let <math>b(p)</math> denote the unique positive integer <math>k</math> such that <math>|k-\sqrt{p}| < \frac{1}{2}</math>. For example, <math>b(6) = 2</math> and <math>b(23) = 5</math>. If <math>S = \sum_{p=1}^{2007} b(p),</math> find the [[remainder]] when <math>S</math> is divided by 1000. |
== Solution == | == Solution == | ||
− | <math>(k- \frac 12)^2=k^2-k+\frac 14</math> and<math>(k+ \frac 12)^2=k^2+k+ \frac 14</math> Therefore <math>b(p)=k</math> if and only if <math>p</math> is in this range, | + | <math>\left(k- \frac 12\right)^2=k^2-k+\frac 14</math> and <math>\left(k+ \frac 12\right)^2=k^2+k+ \frac 14</math>. Therefore <math>b(p)=k</math> if and only if <math>p</math> is in this range, or <math>k^2-k<p\leq k^2+k</math>. There are <math>2k</math> numbers in this range, so the sum of <math>b(p)</math> over this range is <math>(2k)k=2k^2</math>. <math>44<\sqrt{2007}<45</math>, so all numbers <math>1</math> to <math>44</math> have their full range. Summing this up with the formula for the sum of the first <math>n</math> squares (<math>\frac{n(n+1)(2n+1)}{6}</math>), we get <math>\sum_{k=1}^{44}2k^2=2\frac{44(44+1)(2*44+1)}{6}=58740</math>. We need only consider the <math>740</math> because we are working with modulo <math>1000</math>. |
− | Now consider the range of numbers such that <math> | + | Now consider the range of numbers such that <math>b(p)=45</math>. These numbers are <math>\left\lceil\frac{44^2 + 45^2}{2}\right\rceil = 1981</math> to <math>2007</math>. There are <math>2007 - 1981 + 1 = 27</math> (1 to be inclusive) of them. <math>27*45=1215</math>, and <math>215+740=955</math>, the solution. |
== See also == | == See also == |
Revision as of 18:58, 13 December 2007
Problem
For each positive integer , let
denote the unique positive integer
such that
. For example,
and
. If
find the remainder when
is divided by 1000.
Solution
and
. Therefore
if and only if
is in this range, or
. There are
numbers in this range, so the sum of
over this range is
.
, so all numbers
to
have their full range. Summing this up with the formula for the sum of the first
squares (
), we get
. We need only consider the
because we are working with modulo
.
Now consider the range of numbers such that . These numbers are
to
. There are
(1 to be inclusive) of them.
, and
, the solution.
See also
2007 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |