|
|
(7 intermediate revisions by the same user not shown) |
Line 1: |
Line 1: |
| + | <center><u><h1 style="color:black;font-size:200px;font style="font-family:Brush Script MT,courier,arial,helvetica;">[https://artofproblemsolving.com/community/user/350017 '''OliverA's profile''']</h1></u></center> |
| | | |
− | [https://artofproblemsolving.com/community/my-aops] | + | <asy> |
| + | usepackage("qrcode"); |
| + | label("\qrcode[hyperlink,height=1.5in]{https://artofproblemsolving.com/community/user/350017}"); |
| + | </asy> |
| | | |
− | We will count the number of it <math> < 2^{11}=2048 </math> instead of <math>2003</math> (In other words, the length of the base-2 representation is at most <math>11</math>. If there are even digits, <math>2n</math>, then the leftmost digit is <math>1</math>, the rest, <math>2n-1</math>, has odd number of digits. In order for the base-2 representation to have more <math>1</math>'s, we will need more <math>1</math> in the remaining <math>2n-1</math> than <math>0</math>'s. Using symmetry, this is equal to
| + | |
− | <math>\frac{2^9+2^7+..+2^1}{2}</math>
| + | |
− | 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
| + | (I invented this first, OK? :P) |
− | <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^{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>
| |
Latest revision as of 22:45, 7 October 2020
(I invented this first, OK? :P)