AoPSWiki

Art of Problem Solving celebrates the many
accomplishments of its students and community members.

Personal tools

Search

Toolbox

1995 AIME Problems/Problem 13

From AoPSWiki

Problem

Let $f(n)$ be the integer closest to $\sqrt[4]{n}.$ 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 $f(n) = k$ . Thus there are $\left \lfloor \left(k + \frac {1}{2}\right)^4 - \left(k - \frac {1}{2}\right)^4 \right\rfloor$ values of $n$ for which $f(n) = k$ . 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...$

Thus, $\frac{1}{k}$ appears in the summation $4k^3 + k$ times, and the sum for each $k$ is then $(4k^3 + k) \cdot \frac{1}{k} = 4k^2 + 1$ . From $k = 1$ to $k = 6$ , 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 $1995 - 1785 = 210$ terms with $f(n) = 7$ . This adds $210 \cdot \frac {1}{7} = 30$ to our summation, giving $370 + 30 = \boxed{400}$ .

See also

1995 AIME (Problems • Resources)
Preceded by Problem 12	Followed by Problem 14
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/1995_AIME_Problems/Problem_13"

Category: Intermediate Algebra Problems

Art of Problem Solving celebrates the many
accomplishments of its students and community members.

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us