Determine whether f is a function from the set of all bit strings to the set of integers if a) f(s) is the position of a 0 bit in s. b) f(s) is the number of 1 bits in s c) f(s) is the smallest integer i such that the ith bit of s is 1 and f(s) = 0 when s is the empty string, the string with no bits

step-by-step explanation:

-81 -56 -27 0 81

step-by-step explanation:

it is a secret for it not to be compromised sorry

step-by-step explanation:

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