2011 AIME I Problem 11


Let RR be the set of all possible remainders when a number of the form 2n2^n, nn a nonnegative integer, is divided by 10001000. Let SS be the sum of all elements in RR. Find the remainder when SS is divided by 10001000.


Leading zeroes must be inputted, so if your answer is 34, then input 034. Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.

Show/Hide Hints

Show/Hide Problem Tags

Problem Tags: Number theory

Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)
Category: AIME I
Points: 5
Back to practice