Prove that every positive integer can be expressed as the sum of distinct non-negative integer powers of 2. In other words, prove that for every positive integer , there are non-negative integers that are all distinct () such that (Hint: in order to express k 1 in the inductive step, start with finding a number b such that )

question 1 is 8, question 2 is 9, question 3 is 24

step-by-step explanation:

now, the numbers they give you at the top are the key. from there, you just have to plug and chug! let's try 1, 2, and 3!

key: a=3, b=5, c=6

1. a+5

remember, a=3, so we plug that in to get 3+5=8

2. 15-c

c=6, so we plug that in to get 15-6=9

3. 4b

b=6, so we plug it in to get 4*6=24

time to try the rest on your own! if you put the answers below in a comment, i'll check them for you!

you ignore the remainder, therefore the answer is y = x+2

step-by-step explanation:

you have to divide the denominator by the numerator. you can use synthetic division or long division.

[-5] .     1 .     7 .     11

x + 2 + 1/x+5