Answer:
x=−4+√13 or x=−4−√13
Can I have brainliest? I need it for a challenge
Step-by-step explanation:
Answer:
1. x = -4y ---> y = (-1/4)x
slope = -1/4. y-intercept = (0,0)
2. y = -2x + 4
3. y = (1/3)x - 1
Step-by-step explanation:
1. Re-write your equation so that x is on the right and y is on the left:
x = -4y ---> y = (-1/4)x
slope = -1/4. y-intercept = (0,0)
2. y-intercept = (0,4) ----> P1
x-intercrpt = (2,0) ----> P2
slope m = (y2 - y1) / (x2 - x1)
= (0 - 4)/(2 - 0)
= -2
therefore, y - y1 = mx - x1 ---> y - 4 = -2x
or y = -2x + 4
3. y-intercept = (0,-1)
x-intercept = (3,0)
m = (0 - (-1)) / (3 -0) = 1/3
y - (-1) = (1/3)x - 0 ---> y = (1/3)x - 1
When I took the test, I selected "C. an arrangement in which you receive money now and pay it back later with fees" but I got it wrong. So I'm pretty sure the answer is "A. an arrangement in which you receive money, goods, or services now in exchange for the promise of payment later"
3/4 + 1 = 1.75 which is equivalent to 7/4
1- 3/4 = 0.25 which is equivalent to 1/4
the problem now looks like 7/4 / 1/4
you cancel out both 4
this problem simplified looks like 7/1
which is equivalent to 7 if you divide
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 #)
