Difference between revisions of "2003 AIME I Problems/Problem 13"
(→Solution 3) |
(→Solution 3) |
||
Line 35: | Line 35: | ||
Using similar argument where there are odd amount of digits. The remaining even amount of digit must contains the number of <math>1</math>'s at least as the number of <math>0</math>'s. So it's equal to | Using similar argument where there are odd amount of digits. The remaining even amount of digit must contains the number of <math>1</math>'s at least as the number of <math>0</math>'s. So it's equal to | ||
<math>\frac{\binom{10}{5}+2^{10}+\binom{8}{4}+2^8+\binom{6}{3}+2^6+...+\binom{0}{0}+2^0}{2}</math> | <math>\frac{\binom{10}{5}+2^{10}+\binom{8}{4}+2^8+\binom{6}{3}+2^6+...+\binom{0}{0}+2^0}{2}</math> | ||
− | Summing both cases, we have <math>\frac{2^0+2^1+..+2^ | + | Summing both cases, we have <math>\frac{2^0+2^1+..+2^{10}+\binom{0}{0}+..+\binom{10}{5}}{2} = 1199</math>. There are <math>44</math> numbers between <math>2004</math> and <math>2047</math> inclusive that satisfy it. So the answer is <math>1199-44=1\boxed{155}</math> |
== See also == | == See also == |
Revision as of 05:34, 26 June 2020
Problem
Let be the number of positive integers that are less than or equal to and whose base- representation has more 's than 's. Find the remainder when is divided by .
Solution 1
In base- representation, all positive numbers have a leftmost digit of . Thus there are numbers that have digits in base notation, with of the digits being 's.
In order for there to be more 's than 's, we must have . Therefore, the number of such numbers corresponds to the sum of all numbers on or to the right of the vertical line of symmetry in Pascal's Triangle, from rows to (as ). Since the sum of the elements of the th row is , it follows that the sum of all elements in rows through is . The center elements are in the form , so the sum of these elements is .
The sum of the elements on or to the right of the line of symmetry is thus . However, we also counted the numbers from to . Indeed, all of these numbers have at least 's in their base- representation, as all of them are greater than , which has 's. Therefore, our answer is , and the remainder is .
Solution 2
We seek the number of allowed numbers which have 1's, not including the leading 1, for .
For , this number is
.
By the Hockey Stick Identity, this is equal to . So we get
.
For , we end on - we don't want to consider numbers with more than 11 digits. So for each we get
again by the Hockey Stick Identity. So we get
.
The total is . Subtracting out the numbers between and gives . Thus the answer is .
Solution 3
We will count the number of it instead of (In other words, the length of the base-2 representation is at most . If there are even digits, , then the leftmost digit is , the rest, , has odd number of digits. In order for the base-2 representation to have more 's, we will need more in the remaining than 's. Using symmetry, this is equal to Using similar argument where there are odd amount of digits. The remaining even amount of digit must contains the number of 's at least as the number of 's. So it's equal to Summing both cases, we have . There are numbers between and inclusive that satisfy it. So the answer is
See also
2003 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.