Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2011 AIME I Problems/Problem 11"

(Created page with '== Problem == Let <math>R</math> be the set of all possible remainders when a number of the form <math>2^n</math>, <math>n</math> a nonnegative integer, is divided by <math>1000<…')
 
(→‎Problem)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 
Let <math>R</math> be the set of all possible remainders when a number of the form <math>2^n</math>, <math>n</math> a nonnegative integer, is divided by <math>1000</math>. Let <math>S</math> be the sum of the elements in <math>R</math>. Find the remainder when <math>S</math> is divided by <math>1000</math>.
 
Let <math>R</math> be the set of all possible remainders when a number of the form <math>2^n</math>, <math>n</math> a nonnegative integer, is divided by <math>1000</math>. Let <math>S</math> be the sum of the elements in <math>R</math>. Find the remainder when <math>S</math> is divided by <math>1000</math>.
 +
 +
== Solution 1==
 +
Note that the cycle of remainders of <math>2^n</math> will start after <math>2^2</math> because remainders of <math>1, 2, 4</math> will not be possible after (the numbers following will always be congruent to 0 modulo 8). Now we have to find the order. Note that <math>2^{100}\equiv 1\mod 125</math>. The order is <math>100</math> starting with remainder <math>8</math>. All that is left is find <math>S</math> in mod <math>1000</math> after some computation.
 +
<math></math>S=2^0+2^1+2^2+2^3+2^4...+2^102\equiv 2^103-1\equiv 8-1\equiv \boxed{007}\mod 1000$.

Revision as of 13:05, 19 March 2011

Problem

Let $R$ be the set of all possible remainders when a number of the form $2^n$, $n$ a nonnegative integer, is divided by $1000$. Let $S$ be the sum of the elements in $R$. Find the remainder when $S$ is divided by $1000$.

Solution 1

Note that the cycle of remainders of $2^n$ will start after $2^2$ because remainders of $1, 2, 4$ will not be possible after (the numbers following will always be congruent to 0 modulo 8). Now we have to find the order. Note that $2^{100}\equiv 1\mod 125$. The order is $100$ starting with remainder $8$. All that is left is find $S$ in mod $1000$ after some computation. $$ (Error compiling LaTeX. Unknown error_msg)S=2^0+2^1+2^2+2^3+2^4...+2^102\equiv 2^103-1\equiv 8-1\equiv \boxed{007}\mod 1000$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_AIME_I_Problems/Problem_11&oldid=37662"