The answer is C because it’s the same line
Answer:
720 possible ways
Step-by-step explanation:
The gold is awarded to the first position, the silver is awarded to the second position while the bronze is awarded to the third position.
The first position can be taken by any of the 10 runners
Now, the second position can be taken by remaining 9 runners
while the third position can be taken by the renaming 8 runners.
Thus, the number of ways in which these medals can be awarded = 10 * 9 * 8 = 720 ways
In 22, you're looking for the vertical height of the triangle. You're given the angle opposite the side you want to find (which I'll call
) and the length of the hypotenuse. This sets you up with the relation
In 23, you're given a similar situation, except now you're looking for the angle (I'll call it
) in the triangle opposite the side denoting the height of the airplane. So this time,
Answer:
D(-7,-2)
Step-by-step explanation:
A(-4,3) B(5,-1) C(-2,-6) D(-7,-2)
A: 5×(-4) + 6×3 = -2 ≥ -30 ..... No
B: 2/3×5 + 1 =4.33 ≥ -1 ....No
C: -6 ≤ 2/3×-2 +1 ....No
D: 2/3×(-7)+1 = 2.333 ≤ -2
5×(-7) + 6×(-2) = -47 ≤ -30 ......Yes
In order to answer the above question, you should know the general rule to solve these questions.
The general rule states that there are 2ⁿ subsets of a set with n number of elements and we can use the logarithmic function to get the required number of bits.
That is:
log₂(2ⁿ) = n number of <span>bits
</span>
a). <span>What is the minimum number of bits required to store each binary string of length 50?
</span>
Answer: In this situation, we have n = 50. Therefore, 2⁵⁰ binary strings of length 50 are there and so it would require:
log₂(2⁵⁰) <span>= 50 bits.
b). </span><span>what is the minimum number of bits required to store each number with 9 base of ten digits?
</span>
Answer: In this situation, we have n = 50. Therefore, 10⁹ numbers with 9 base ten digits are there and so it would require:
log2(109)= 29.89
<span> = 30 bits. (rounded to the nearest whole #)
c). </span><span>what is the minimum number of bits required to store each length 10 fixed-density binary string with 4 ones?
</span>
Answer: There is (10,4) length 10 fixed density binary strings with 4 ones and
so it would require:
log₂(10,4)=log₂(210) = 7.7
= 8 bits. (rounded to the nearest whole #)
