Step-by-step explanation:
every flip has 2 possible outcomes.
1 flip has 2.
2 flips have 2×2 = 2² = 4
3 flips have 2×2×2 = 2³ = 8
and so on.
the number of possible combinations flipping a coin n times is
C(n) = 2^n
for 10 flips
C(10) = 2¹⁰ = 1024
possible outcomes or combinations.
Y = 25x
Slope is rise over run or (y2-y1)/(x2-x1)
(25-0)/(1-0)=25
No b value in y=mx+b because the origin is at 0.
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:
The easiest way to do this is to reflect Figure I over the Y axis. Then move it up 3 and left 2.
Answer:
7:yes
8:no
9:yes
10:sorry
Step-by-step explanation:
