Difference between revisions of "2012 AIME II Problems/Problem 7"
(added solution tag, capitalized also) |
|||
| Line 4: | Line 4: | ||
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
| − | == See | + | == See Also == |
{{AIME box|year=2012|n=II|num-b=6|num-a=8}} | {{AIME box|year=2012|n=II|num-b=6|num-a=8}} | ||
Revision as of 14:44, 3 April 2012
Problem 7
Let 
be the increasing sequence of positive integers whose binary representation has exactly 
ones. Let 
be the 1000th number in . Find the remainder when is divided by 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2012 AIME II (Problems • Answer Key • Resources) | ||
| 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 | ||
