 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/digital-systems-linear-algebra-introduction-to-formal-proof/1/a/solution

a = (a_{n - 1}, \dots, a_{0})

, with

a_{0}

the least significant bit. Its unsigned interpretation of a bit string is $bin (a) = \sum_{i = 0}^{n - 1} a_{i} 2^{i}$ , where each

a_{i} \in {0, 1}

. The range is the integers from

0

through

2^{n} - 1

; a leading one contributes positive weight

2^{n - 1}

, not a sign.

 New to topics? Read the docs here!