Answer: 18 units
Step-by-step explanation:since its is a horizontal line x2 - x1
7 -1 = 6
line 2:
since this is a vertical line y2 - y1
7 - 3 = 4
line 3:
since this is a horizontal line x2 - x1
7 - 4 = 3
line 4:
for this we need to use the distance formula which allows us to find the distance making a third point to form a right angle triangle
point 1: (1,3)
point 2: (4,7)
point 3 (new point) : (4,3)
now we can apply the pythogorean thereum (C squared = B squared + A squared) with the following lines.
line 1: (1,3) - (4,7)
line 2: (1,3) - (4,3)
line 3: (4,3) - (4,7)
line 1 squared = line2 squared + line 3 squared
calculate length of line 2 and 3
line 1 squared = (4 - 1) squared + (7 - 3) squared
line 1 squared = 3 squared + 4 squared
line 1 squared = 9 + 16
line 1 squared = 25
root both sides
line 1 = 5
add all the liens together
6 + 4 + 3 + 5 = 18
Answer:
6 + 8x
46
Step-by-step explanation:
1. Write the expression
6 + 8x
2. Plug in 5 for x
6 + 8(5) → 6 + 40 = 46
Answer:
308.13/15=20.553 or 21
Step-by-step explanation:
hope this helps
plz mark brailiest
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 #)
