Binary Problem

Level pending

Let n be the number of integers x such that \( 2^{2013} \le x < 2^{2014} \) and when x is written in binary there are at least as many 0s as 1s. What is the sum of the digits of n when it is written in binary?

×

Problem Loading...

Note Loading...

Set Loading...