EulerFermatTheorem
AIME
Difficult
2011
Let $R$ be the set of all possible remainders when a number of the form $2^n$, where $n$ is a non-negative integer, is divided by $1000$. Let $S$ be the sum of the elements in $R$. Find the remainder when $S$ is divided by $1000$.
The solution for this problem is available for
$0.99.
You can also purchase a pass for all available solutions for
$99.