Prove that any positive integer n can be written as distinct powers of 2 .
Between which steps am I missing something? If the missing step is between 1 and 2, input as 12.
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.
In future, you might want to make questions with only a small finite set of answers multiple choice. Multiple choice means only 1 guess, whereas a numerical answer gives 3 guesses. In the problem above, the answer was going to be either 12, 23, 34, 45 or 56. I guessed it wouldn't be the answer that you had chosen to illustrate in the problem, and also felt it was unlikely to be 56 as it is the last one, so worked my way through 23,34,45 and got it right
Log in to reply
Noted, but given that MCQs offer only one chance, I'd rather stick to short questioning.
Problem Loading...
Note Loading...
Set Loading...
You should see that I have forgotten to put 2 k > a .
Because if not, 2 k might be one of a = 2 x 1 + 2 x 2 + 2 x 3 + . . . . . . + 2 x m , which contradicts with our statement n + 1 can be a sum of distinct powers of 2 .