Answer: What is the questions
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
For this case we have the following polynomial:
We must find the greatest common factor of the terms of the polynomial.
The GCF of the coefficients is given by:
Then we look for the GFC of the variables:
We have then:
Finally rewriting we have:
Answer:
the complete factored form of the polynomial is:
Answer:480
Step-by-step explanation:
Multiply each number to end up with the answer.
Answer:
I believe the answer is 10 units.
