Answer:
B of course you dummy
Step-by-step explanation:
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:
x = -4 or x = 2
Step-by-step explanation:
Answer:
Option a. convergent: A
Step-by-step explanation:
a0=3/2
a1=9/8
a2=27/32
a1/a0=(9/8)/(3/2)=(9/8)*(2/3)→a1/a0=3/4
a2/a1=(27/32)/(9/8)=(27/32)*(8/9)→a2/a1=3/4
r=a1/a0=a2/a1→r=3/4
The abosute value of r= !r! = !3/4! = 3/4 = 0.75<1, the series is convergent
extraneous root is a solution o an equation that seems to be right but when we check it (by substituting it into the original equation) it turns out not to be right
