1) 13a=-5
Make a the subject of the formula by dividing both sides by 13(the coefficient of a)
13a/13=-5/13
Therefore a= -0.385
The second one). 12-b= 12.5
You take the 12 to the other side making b subject of the formula (-b in this case)
-b= 12.5-12
-b= 0.5
(You cannot leave b with a negative sign so you will divide both sides by -1 to cancel out the negative sign)
-b/-1= 0.5/-1
Therefore b=-0.5
The third one). -0.1= -10c
You will divide both sides by the coefficient of c(number next to c) which is -10
-0.1/-10= -10c/-10
Hence, c= 0.01
Answer: First option
Step-by-step explanation:
You have the quadratic equation given in the problem:
To find an equivalent expression you cacn factorize. Find two numbers whose sum is -13 and whose product is -30.
These numbers would be -15 and 2.
Therfore, you obtain the following equivalent expression:
If you don't want to apply the method above, you can use the quadratic formula:
Where:
When you susbstitute values you obtain that:
Then you can rewrite the equation as
The answer is:
7/33 or 0.21212 a good Approved! that you can use for these types of problems is fraction Calculator plus free
Since there are three variables and three constants you add like terms.
3(x+15) = 3x + 40
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 #)
