Answer:
Step-by-step explanation:
The recursive rule tells you the initial term of the sequence is a1 = -3, and the common difference is d=7. (7 is the value added to one term to get the next term.)
Putting these values into the formula for the explicit rule gives ...
an = a1 +d(n -1)
an = -3 + 7(n -1)
9/100 is less because if we multiply 7/10 by 10 (to get an equivalent fraction with a denominator the same as the other fraction [100]) we get 70/100, which is way more than 9/100.
So, 7/10 is greater than 9/100
Hope this helps!
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
81.49 is the answer. Have a great day!
Answer:
Step-by-step explanation:
480?
