C-1.4 What is the total running time of counting from 1 to n in binary if the time needed to add 1 to the current number i is proportional to the number of bits in the binary expansion of i that must change in going from i to i 1?

if you're trying to figure out how much each ounce cost it would be 0.20

cents each ounce

let's call the solutions x₁ = (5 - 2√7)/3 and x₂ = (5 + 2√7)/3

then the equation is (x-x₁)(x-x₂) = 0

if you fill that in you get a lot of numbers which you can recognize as ax²+bx+c=0.

step-by-step explanation:

you can see that a=1 (there is just an x²)

b = (-5 -2√7 + 2√7 - 5)/3 = -10/3

c = -2√7)/3 ) * (-5+2√7)/3) = -1/3

so your answer is 3x^2 – 10x – 1 = 0