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
Each child has a 50% chance to be a girl and 50%chance to be a boy so with 4 children the probability is
Answer:
The answer is 3,906.25
Step-by-step explanation:
All you have to do is divide 15,625 by 4! :)
Answer:
• x = -4, x = 0, x = 1
Step-by-step explanation:
x is a factor of all terms, so x=0 is a zero. (Eliminates choices 1 and 5.)
The sum of coefficients is 0, so x=1 is a zero. (Eliminates choices 3 and 4.)
Reversing the sign of the odd-degree terms gives signs of -++, so there is one sign change, hence one negative real root (by Descartes' rule of signs). This confirms choice 2 as the answer.
___
Of course, your graphing calculator can answer this almost as quickly.
<em>Your answer will be, </em><em>"6p - 8"</em>
Thanks,
<em>Deku ❤</em>