Answer:
Step-by-step explanation: 2003160
If you add them up, you get 2003160.
So the lakes holds 2003160 LITERS of water to the current date.
Please mark Brainliest I need it
Basically, Justin and Tina's paths form two right-angled triangles whose hypotenuses(?) form a straight line between their end points. Therefore we need to find the two distances from the starting point and add them.
Justin walked 3 miles north and 6 miles west so his distance from the start is the square root of 9+36 or 45. This can be simplified to 3√5.
Tina walked 2 miles south and 4 miles east so her distance from the starting point is the square root of 4 + 16 or 20. This can be written as 2√5.
If we add these two distances together we get 5√5. Hence, Justin and Tina are 5√5 miles away from each other.
Answer:
x = -96/23
Step-by-step explanation
- 
= 4
multiply each side of equation by 24 to eliminate denominators
(24) - = 4 (24)
3(3x) - 8(4x) = 96
9x - 32x = 96
-23x = 96
x = -96/23
Answer:
y=2x squared -3x-62
Step-by-step explanation:
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 #)
