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:
Slope=4
x−intercept=−
4
16
=−4
b−intercept=
1
16
=16.0000
Step-by-step explanation:
Ratio 5:2 as fraction should be 5/2
as you know 5/2 = 2.5
This is the biggest compared to 9/5, 8/5 and 2/7
9/5 < 2
8/5 <2
2/7 < 1
so 5/2 is greatest
Answer:
17
Step-by-step explanation:
If you think about it, 
is 17×17
Hope this helps!
Answer:
d. 14
Step-by-step explanation:
- 3(2) = 3 × 2 = 6
- Plug 6 in: 12 + {10 ÷ [11 - 6]}
- 11 - 6 = 5
- Plug 5 in: 12 + {10 ÷ 5}
- 10 ÷ 5 = 2
- Plug 2 in: 12 + 2
- 12 + 2 = 14
I hope this helps!
