Use strong induction to show that every positive integer n 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. Let P(n) be the proposition that the positive integer n can be written as a sum of distinct powers of 2. Identify the inductive hypothesis that proves P(n) is true. (You must provide an answer before moving to the next part.)

dont understand

step-by-step explanation:

amount of oatypop that contains the prize = 40%

amount   of oatypop which doesn't contain the prize = (100-40)=60%

probability that hannah will win a prize

    = s +f s +f f s+ff   f s+ff f f s+ infinity.where f= failure,s= success

=   or 60%

probability that hannah only has to buy 3 or less boxes before getting a prize= (s) and ( f s) and (ff s) and (f f f s)

        = = 87.04 %  

step-by-step explanation:

correct choice is a

step-by-step explanation:

the equation of the line passing through the points and is

thus, the equation of the line that passes through the points (0, -6) and (-3, 0) is

the answer is b.

64

step-by-step explanation:

c=2πr=2·π·8≈64