Answer:
Original angle = 122*
Supplementary angle = 58*
Step-by-step explanation:
A supplementary angle is one of two angles that make up 180*
If one angle is 30*, its supplementary angle is 150*. 30 + 150 = 180.
So in this case we have two angles, the original and the supplementary angle. The original angle is 64* more than the supplementary angle. The key word is MORE.
The formula to figure it out would look like this: x + (x + 64) = 180
x is the supplementary angle
x + 64 is the original angle (64 MORE than its supplementary angle)
180 is the total measure of the two angles because they are supplementary and we know that supplementary angles always equals 180* when added together.
Take the formula and do a little algebra.
x + (x + 64) = 180
Subtract 64 from both sides
x + x = 116
Combine the x's
2x = 116
Divide both side by 2
x = 58
Remeber we know that the original angle is 64 more than the supplementary angle, so we'll add the 64 to the value of x and we get 122.
x + 64 = 122
Check our work:
x + (x + 64) = 180
58 + 58 + 64 = 180
You would write the following proportion: 4/12= 180/x
When you solve the proportion the answer is 540, which means that 12 game packet costs $540.
<span>Simplify (8 + 7i) + (2 –i)
</span>answer:10+6i
Answer:
- 45/1024
- 1/4
- 15/128
- 193/512
- 9/512
Step-by-step explanation:
There are 2^10 = 1024 bit strings of length 10.
a) There are 10C2 = 45 ways to have exactly two 1-bits in 10 bits
p(2 1-bits) = 45/1024
__
b) Of the four (4) possibilities for beginning and ending bits (00, 01, 11, 10), exactly one (1) of those is 00.
p(b0=0 & b9=0) = 1/4
__
c) There are 10C7 = 120 ways to have seven 1-bits in the bit string.
p(7 1-bits) = 120/1024 = 15/128
__
d) ∑10Ck {for k=0 to 4} = 386 is the total of the number of ways to have 0, 1, 2, 3, or 4 1-bits in the string. If there are more than that, there won't be more 0-bits than 1-bits
p(more 0 bits) = 386/1024 = 193/512
__
e) The string will have two 1-bits if it starts with 1 and there is a single 1-bit among the other 9 bits. There are 9 ways that can happen, among the 512 ways to have 9 remaining bits.
p(2 1-bits | first is a 1-bit) = 9/512
To find the x-intercept what you do is you plug in zero for Y:
0=4x-8
Then you would add 8 to the left side and x =2
