. Use strong induction to show that every positive integer can be written as a sum of distinct powers of two, that is, as a sum of a subset of the integers 20 =1, 21 =2, 22 =4, and so on. [Hint: For the inductive step, separately consider the case where k+1 is even and where it is odd. When it is even, note that (k+1)∕2 is an integer.]

Just add 10+3m the m means the roman numeral m is often used to indicate one thousand, and mm is used to indicate one million. for example, an expense of $60,000 might appear as $60m. sales of $3,000,000 might be written as $3mm. internet advertisers are familiar with cpm which is the cost per thousand impressions. so 10+3m= 300,000,010hope this and if it does can i have brainlest? if not tell me what i did wrong but i’m pretty sure i am right.

This is the same as saying x27y divided by 3. 27/3=9, so the expression can be simplified to 9xy