Answer:
2x+1
Step-by-step explanation:
factor the trinomial equation and u will get a perfect square
Answer:
Let us check these out one at a time:
1. x + y is odd. FALSE. The sum of 2 odd numbers is even.
2. xy is odd. TRUE. The product of 2 odd numbers is odd.
3. x/y is odd. TRUE. The ratio of 2 odd numbers is odd, if the ratio is an integer.
4. x - y is odd. FALSE. The difference of 2 odd numbers is even.
Only statements 2 and 3 are TRUE, so that makes (C) the correct answer.
Answer:
<u>The distance from the helicopter to the further observer is:</u>
<u>d = 12.77 miles</u>
Step-by-step explanation:
The observer with 19.5° of elevation will be denoted by 1
The observer with 31.2° of elevation will be denoted by 2.
Here we have two right triangles. Both of them have the same opposite sides, so will be useful to use the tangent function.
For the second observer:
(1)
Where:
- h is the opposite side
- x is the adjacent side (distance from the observer 2 to the point where the angle of elevation is 90° )
For the first observer:
(2)
Where:
- h is the opposite side
- 5+x is the adjacent side (distance from the observer 1 to the 90° elevation point, 5 miles is the distance between observes )
Let's find x from equations (1) and (2). Both of them have the variable "h" so we can equal these equations.
Now, if we use the right triangle with 19.5° of elevation, the hypotenuse will be the distance from the helicopter and the further observer (let's call d).
Let's use the cosine function to find d.
I hope it helps you!
3.962 to the nearest hundredth = 3.96
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 #)