Difference between revisions of "2012 AIME II Problems/Problem 7"

(Created page with "== Problem 7 == Let <math>S</math> be the increasing sequence of positive integers whose binary representation has exactly <math>8</math> ones. Let <math>N</math> be the 1000th n...")
 
Line 1: Line 1:
 
== Problem 7 ==
 
== Problem 7 ==
 
Let <math>S</math> be the increasing sequence of positive integers whose binary representation has exactly <math>8</math> ones. Let <math>N</math> be the 1000th number in <math>S</math>. Find the remainder when <math>N</math> is divided by <math>1000</math>.
 
Let <math>S</math> be the increasing sequence of positive integers whose binary representation has exactly <math>8</math> ones. Let <math>N</math> be the 1000th number in <math>S</math>. Find the remainder when <math>N</math> is divided by <math>1000</math>.
 +
 +
 +
== Solution ==
 +
 +
== See also ==
 +
{{AIME box|year=2012|n=II|num-b=6|num-a=8}}

Revision as of 17:20, 31 March 2012

Problem 7

Let $S$ be the increasing sequence of positive integers whose binary representation has exactly $8$ ones. Let $N$ be the 1000th number in $S$. Find the remainder when $N$ is divided by $1000$.


Solution

See also

2012 AIME II (ProblemsAnswer KeyResources)
Preceded by
Problem 6
Followed by
Problem 8
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions