ThmDex – An index of mathematical definitions, results, and conjectures.
▼ Set of symbols
▼ Alphabet
▼ Deduction system
▼ Theory
▼ Zermelo-Fraenkel set theory
▼ Set
▼ Collection of sets
▼ Set union
▼ Successor set
▼ Inductive set
▼ Set of inductive sets
▼ Set of natural numbers
▼ Set of integers
▼ Integer
▼ Integer base-2 representation
Definition D6269
N-bit integer
Formulation 0
Let $N \in \{ 1, 2, 3, \ldots \}$ be a D5094: Positive integer.
An D995: Integer $a \in \mathbb{Z}$ is an N-bit integer with $N$ bits if and only if \begin{equation} \exists \, r_0, r_1, \ldots, r_{N - 1} \in \{ 0, 1 \} : a = - r_{N - 1} 2^{N - 1} + \sum_{n = 0}^{N - 2} r_n 2^n \end{equation}
Also known as
Two's complement N-bit integer
Children
▶ D6266: 16-bit integer
▶ D6267: 32-bit integer
▶ D6268: 64-bit integer
▶ D6265: 8-bit integer