Answer:
Step-by-step explanation:
7(p-6)=8p-34
Distribute 7 into the parentheses on the Left Hand Side of the equation
7p-42=8p-34
get p together, so minus 7p on both sides
7p-7p-42=8p-7p-34
7p and -7p cancel out on L.H.S
-42=p-34
isolate p by adding 34 to both sides
-42+34=p-34+34
-34 and postitive 34 cancel out on the R.H.S
p=-8
Hope this helps! :)
Y=1000*1.03^x is the correct compound recursive formula!
The product of five and FOUR is twenty.
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 #)
