Skip to content

fix n and N inconsistency #119

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
iwasnevergivenaname wants to merge 1 commit into
base: main
Choose a base branch
from
Open

fix n and N inconsistency #119

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions content/number-rep/twos-complement.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,7 +53,7 @@ Suppose you use $N$ bits to represent integers with two's complement. How many p

* Zero: 1
* Positive: $2^{N-1} - 1$
* Negative: $2^{n-1}$
* Negative: $2^{N-1}$
:::

## Arithmetic and conversion
Expand Down Expand Up @@ -96,7 +96,7 @@ $$
- 2^{n-1} d_{n-1} + \sum_{i=0}^{n-2} 2^i d_i
$$

Positive and negative numbers can be computed using the same formula. Above, the sign is computed by multiplying the highest bit by $(-2^{N-1})$.
Positive and negative numbers can be computed using the same formula. Above, the sign is computed by multiplying the highest bit by $(-2^{n-1})$.

:::{card}
Example: $5$ and $-5$ in 4-bit two's complement
Expand Down