Answer:
Places in binary coding
1 - 2 - 4 - 8 - 16 - 32 - 64 - 128 - 256 - 512 - 1024 - 2048
2483 - 2048 = 435 there is 1 in the 2048 position
435 - 256 = 179 there is 1 in the 256 position
179 - 128 = 51 there is 1 in the 128 position
51 - 32 = 19 there is 1 in the 32 position
19 - 16 = 3 there is 1 in the 16 position
3 - 2 = 1 there is 1 in the 2 position
1 - 1 = 0 there is 1 in the 1 position
10011011 0011 would be the binary result
Check:
2048 + 0 + 0 + 256 + 128 + 0 + 32 + 16 + 0 + 0 + 2 + 1 = 2483
Answer:
Step-by-step explanation:
first part: 3/25
second part: 1/25
third part: 4/25
Answer:
A trick I did when it comes to multiplying by 10, is just add a 0 at the end of the number your multiplying. Try for yourself!
Thank you for posting your question here at brainly. I hope the answer will help you. Feel free to ask more questions.
2^n - 3 = 83
<span>2^n = 86 </span>
<span>ln(2^n) = ln(86) </span>
<span>n*ln(2) = ln(86) </span>
<span>n= ln(86)/[ln(2)] (which is the same as "log base 2 of 86") </span>
<span>n= 6.426264755</span>
