## Thinking Mathematically (6th Edition)

Published by Pearson

# Chapter 4 - Number Representation and Calculation - 4.2 Number Bases in Positional Systems - Exercise Set 4.2 - Page 226: 63

#### Answer

The binary code for $m$ is: $1101101$

#### Work Step by Step

The essay states that the lowercase letter $m$ is assigned the number $109$. To find the binary representation for this, use division. The place values in base two are $..., 2^7, 2^6, 2^5, 2^4, 2^3, 2^2, 2^1, 1$ The place values that are less than or equal to $109$ are $2^6, 2^5, 2^4, 2^3, 2^2, 2^1$ and $1$. Divide $109$ by $2^6$ or $64$: $109 \div 64 = 1$ remainder $45$ Divide $45$ by $2^5$ or $32$ $45 \div 32 = 1$ remainder $13$ Divide $13$ by $2^4$ or $16$: $13 \div 16 = 0$ remainder $13$ Divide $13$ by $2^3$ or $8$: $13 \div 8 = 1$ remainder $5$ Divide $5$ by $2^2$ or $4$: $5 \div 4=1$ remainder $1$ Divide $1$ by $2^1$ or $2$: $1 \div 2 = 0$ remainder $1$ Divide $1$ by $1$: $1 \div 1 = 1$ Thus, $109 = (1 \times 2^6) + (1 \times 2^5) + (0 \times 2^4)+(1 \times 2^3)+(1\times 2^2) + (0 \times 2^1)+(1 \times 1) \\109=1101101_{\text{two}}$

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.