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:
84
Step-by-step explanation:
Let the first digit = x
Let the second digit =y
x + y = 12
x + 4 = 3*y
===========
From the second equation, we learn that x = 3y - 4
Put that into the first equation.
3y - 4 + y = 12 Combine the left side
4y - 4 = 12 Add 4 to both sides
4y = 16 Divide by 4
4y/4 = 16/4
y = 4
=================
x + 4 = 12
x + 4 - 4 = 12-4
x = 8
So the number is 84
6,400 parts are needed to make 1 ton of scrap metal
Answer:
A
Step-by-step explanation:
Since f(x) is graphed, you need to look at the specified intervals and see which of them have the entire portion graphed below the x axis.
Correct answer: y=(2/3)x
The line passes through the origin (0,0) and the pair (3,2)
the equation y=(2/3)x satisfies both points:
for (0,0): 0=(2/3)*0 = 0
for (3,2): 2 = (2/3)*3 = 2
and therefore is the correct linear function of the line described.
