Difference between revisions of "Mock AIME 6 2006-2007 Problems"
JoetheFixer (talk | contribs) |
JoetheFixer (talk | contribs) (→Problem 1) |
||
Line 1: | Line 1: | ||
==Problem 1== | ==Problem 1== | ||
− | Let <math>T</math> be the sum of all positive integers of the form <math>2^r\cdot3^s</math>, where <math>r</math> and <math>s</math> are | + | Let <math>T</math> be the sum of all positive integers of the form <math>2^r\cdot3^s</math>, where <math>r</math> and <math>s</math> are nonnegative integers that do not exceed <math>4</math>. Find the remainder when <math>T</math> is divided by 1000. |
[[Mock AIME 6 2006-2007 Problems/Problem 1|Solution]] | [[Mock AIME 6 2006-2007 Problems/Problem 1|Solution]] |
Revision as of 14:15, 30 November 2014
Contents
Problem 1
Let be the sum of all positive integers of the form
, where
and
are nonnegative integers that do not exceed
. Find the remainder when
is divided by 1000.