Hello,

Here's an interesting problem that I have solved, but would like someone else's input simply to see if people come up with the same solution or possibly find a more elegant one. I hope anyone who tries this has fun with the problem!

Which numbers can be written by selecting a subset of the powers of two and alternating them (positive-negative,..., negative-positive,...) and list them in increasing order to form a sum. *A sum cannot be made by simply one power of two, namely n=n. SO, can ALL positive integers be written this way? how many ways can a number 'n' be written as an alternating sum of powers of two?

Thanks in advance,

Rutzer

Here's an interesting problem that I have solved, but would like someone else's input simply to see if people come up with the same solution or possibly find a more elegant one. I hope anyone who tries this has fun with the problem!

Which numbers can be written by selecting a subset of the powers of two and alternating them (positive-negative,..., negative-positive,...) and list them in increasing order to form a sum. *A sum cannot be made by simply one power of two, namely n=n. SO, can ALL positive integers be written this way? how many ways can a number 'n' be written as an alternating sum of powers of two?

Thanks in advance,

Rutzer

Last edited by a moderator: