Matthew Prey
New member
- Joined
- Jun 19, 2019
- Messages
- 5
"Every natural number n can be represented as a sum of powers of 2."
Tip : 2^b ≤ n < 2^(b+1) for all b ∈ N.
Tip : 2^b ≤ n < 2^(b+1) for all b ∈ N.
Please show some effort, as we ask:"Every natural number n can be represented as a sum of powers of 2."
Tip : 2^b ≤ n < 2^(b+1) for all b ∈ N.
If this is the exact problem statement then there is nothing to prove. 1 is a power of 2 and any number n is a sum of n 1s. I'm guessing they want distinct powers of 2."Every natural number n can be represented as a sum of powers of 2."
Tip : 2^b ≤ n < 2^(b+1) for all b ∈ N.