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
2x + 8 would be the simplified version of this question
Answer:
that's the correct answer
Answer:
sure (can i have brainliest?)
Step-by-step explanation:
<u>Answer:</u>

<u>Step-by-step explanation:</u>
Given dimensions of the box = 20cm × 6cm × 4cm .
Dimension of the cube = 2cm × 2cm × 2cm .
Therefore the number of cubes that can be fitted into the box will be equal to the Volume of box divided by the Volume of the cube. So ,


<h3>
<u>Hence</u><u> the</u><u> </u><u>number</u><u> </u><u>of</u><u> </u><u>cubes</u><u> </u><u>that</u><u> </u><u>can</u><u> </u><u>be</u><u> </u><u>fitted</u><u> </u><u>in</u><u> the</u><u> </u><u>box </u><u>is</u><u> </u><u>6</u><u>0</u><u> </u><u>.</u></h3>