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 2^0 = 1.2^1 = 2. 2^2 =4. and so on. (hint: for the inductive step, separately con- sider the case where k + 1 is even and where it is odd. when it is even, note that (k + 1)/2 is an integer.]

there are many solutions.

step-by-step explanation:

step 1: simplify both sides of the equation.

4x+6=4x^2+10x−4

step 2: subtract 4x^2+10x-4 from both sides.

4x+6−(4x^2+10x−4)=4x^2+10x−4−(4x^2+10x−4)

−4x^2−6x+10=0

step 3: factor left side of equation.

−2(2x+5)(x−1)=0

step 4: set factors equal to 0.

x=-5/2 or x=1

need more info

step-by-step explanation:

2.2°  

step-by-step explanation:

let θ = the angle of elevation.

tanθ =77/2020

tanθ = 0.038 12

      θ = tan⁻¹0.038 12

      θ = 2.2°