vault backup: 2025-01-27 11:24:37
This commit is contained in:
parent
085f5bf4a7
commit
951d27ba85
@ -25,7 +25,8 @@ In a binary or base 2 number system, each digit can be a zero or one, called a *
|
||||
$$ D = d_{n-1}d_{n-2} \cdots d_1 d_0 $$
|
||||
To determine the integer value, a very similar formula can be used.
|
||||
$$ V(B) = b_{n-1} * 2^{n-1} + b_{n-2} * 2^{n-2} \cdots b_{1} * 2^1 + b_0 * 2^0 $$This formula can be generalized as:
|
||||
*For radix *
|
||||
*For radix $r$*:
|
||||
$$ k = k_{n-1} k_{n-2} \cdots k_1 k_0$$
|
||||
- The base of a number is often notated in the format of $(n)_b$, EG a base 10 number might be $(14)_{10}$, and a binary number might be $(10)_2$.
|
||||
- The *least significant bit* (LSB) is usually the right-most bit. The highest value bit, or the *most significant bit* (MSB).
|
||||
- A nibble is 4 bits, and a byte is 8 bits
|
||||
|
Loading…
x
Reference in New Issue
Block a user