Hi student, let me help you out! :)
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
We are asked to evaluate 
.
- The notation |x| denotes absolute value.
The absolute value of a number is its distance from zero.
Absolute value is always positive; distances can't be negative, right?
So we need to find the absolute value of 98, which is:
Remember this...
Hope it helps you out! :D
Ask in comments if any queries arise.
#StudyWithBrainly
~Just a smiley person helping fellow students :)
Answer:
Step-by-step explanation:
x+4≥10 and x-6>-15
x≥10-4 and x>-15+6
x≥ 6 and x>-9
combining the two
x>-9
I think its like if you got 80% on a quiz and 20% on the exam then your grade would be 60% which is usually a F
Answer:
its 42
Step-by-step explanation:
315-18+81=378
Correct mean =378/9=42
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 #)
