Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer
Answer:
17.043956
Step-by-step explanation:
Knowing nexnjhdjhdhfgnu. Hngj
Solid is if x is greater/less than or equal to (there isn’t a symbol for it) the line and the line would be dashed if x is < or > something
Another way to ask this question: where the x-value of function g equals 12, what's the y-value?
remember that function notation is like so: f(x), g(x), h(x)... so the number in the parentheses is an x-value from the function.
look through your points and find the one that represents an x-value of 12. (12, 19) is the point, and 19 is your output--so, g(12) = 19.
