For how many positive integers are there an odd number of subsets of with size ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
By Lucas's Theorem, ( n 9 9 9 ) is odd if and only if in the binary representation of n , the positions which are 1, are also 1 in the binary representation of 999.
Since 9 9 9 = 1 1 1 1 1 0 0 1 1 1 2 , we have 2 8 − 1 = 2 5 5 possibilities (-1 because we have to exclude n = 0 ).