Mock AIME 5 2005-2006 Problems/Problem 13

Revision as of 20:20, 8 October 2014 by Timneh (talk | contribs) (Problem)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $S$ be the set of positive integers with only odd digits satisfying the following condition: any $x \in S$ with $n$ digits must be divisible by $5^n$. Let $A$ be the sum of the $20$ smallest elements of $S$. Find the remainder upon dividing $A$ by $1000$.

Solution

Solution

See also

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