AoPSWiki
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
Personal tools

1995 AIME Problems/Problem 13

From AoPSWiki

Problem

Let be the integer closest to Find \sum_{k=1}^{1995}\frac 1{f(k)}.

Solution

When \left(k - \frac {1}{2}\right)^4 < n < \left(k + \frac {1}{2}\right)^4, then . Thus there are \left \lfloor \left(k + \frac {1}{2}\right)^4 - \left(k - \frac {1}{2}\right)^4 \right\rfloor values of for which . Expanding using the binomial theorem,

\begin{align*}\left(k + \frac {1}{2}\right)^4 - \left(k - \frac {1}{2}\right)^4 &= \left(k^4 + 2k^3 + \frac 32k^2 + \frac 12k + \frac 1{16}\right) - \left(k^4 - 2k^3 + \frac 32k^2 - \frac 12k + \frac 1{16}\right)\\ &= 4k^3 + k. \end{align*}

Thus, appears in the summation times, and the sum for each is then (4k^3 + k) \cdot \frac{1}{k} = 4k^2 + 1. From to , we get \sum_{k=1}^{6} 4k^2 + 1 = 364 + 6 = 370 (either adding or using the sum of consecutive squares formula).

But this only accounts for \sum_{k = 1}^{6} (4k^3 + k) = 4\left(\frac{6(6+1)}{2}\right)^2 + \frac{6(6+1)}{2} = 1764 + 21 = 1785 terms, so we still have terms with . This adds to our summation, giving .

See also

1995 AIME (ProblemsResources)
Preceded by
Problem 12
Followed by
Problem 14
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
NEW! Hard Problems DVD
A documentary about the 2006 US IMO team. Features many current and past AoPS members!
Click here for more details and to order
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us