3(4) + 12 + 12[4(6) - 10]
12 + 12 + 12(24 - 10)
12 + 12 + 288 - 120
192
Answer:
D. (-∞,4]
Step-by-step explanation:
The range is the y values
The lowest y values is negative infinity
The highest y values is 4
( - inf, 4]
We use the parentheses since we cannot get to negative infinity, the bracket since we reach 4
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 = 9
Step-by-step explanation:
If ΔMNO ≅ ΔPST, their corresponding sides must also be ≅(congruent).
NO is corresponds to TS, thus sides NO and side TS are ≅.
=> 20 = 3x - 7
=> 3x = 27
=> x = 9
Arc length = Ф/360 * 2πr
= 30/360 * 2*3.14*10
= 1/12 * 62.8
= 5.23
In short, Your Answer would be 5.23 cm
Hope this helps!
