Mock AIME 5 2005-2006 Problems/Problem 1

Revision as of 18:40, 13 March 2007 by Azjps (talk | contribs) (testing template)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Suppose $n$ is a positive integer. Let $f(n)$ be the sum of the distinct positive prime divisors of $n$ less than $50$ (e.g. $f(12) = 2+3 = 5$ and $f(101) = 0$). Evaluate the remainder when $f(1)+f(2)+\cdots+f(99)$ is divided by $1000$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

Mock AIME 5 2005-2006 (Problems, Source)
Preceded by
First Question
Followed by
Problem 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15