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
So if you have 192 marbles and you want to group them in groups of 15 marbles each
you would see how many times 15's there are in 192 or how many 192's would go into 15
so 192/15 or
12 and 12/15
The Fibonacci Sequence is a stream of numbers that typically begins with a "0" or "1". From there, any number placed after would be added to the previous number.
For instance, if I started with a "1", and the next number was a "2", the number after would be a "3". From this "3", it would be a "5", the next number would then be a "8".
It would look like this:
1, 2, 3, 5, 8
