2012 AIME II Problems/Problem 7

Revision as of 16:07, 31 March 2012 by Williamhu888 (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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$.

Invalid username
Login to AoPS