ThmDex – An index of mathematical definitions, results, and conjectures.
▼ Set of symbols
▼ Alphabet
▼ Deduction system
▼ Theory
▼ Zermelo-Fraenkel set theory
▼ Set
▼ Binary cartesian set product
▼ Binary relation
▼ Map
▼ Function
▼ Real collection function
▼ Euclidean real function
▼ Real function
▼ Rational function
▼ Integer function
▼ Natural number function
▼ Boolean function
Definition D5931
Boolean parity function
Formulation 0
The boolean parity function with respect to $N \in 1, 2, 3, \ldots$ is the D218: Boolean function \begin{equation} \{ 0, 1 \}^N \to \{ 0, 1 \}, \quad x \mapsto I_{2 \mathbb{Z} + 1} \left( \sum_{n = 1}^N x_n \right) \end{equation}
Formulation 1
The boolean parity function with respect to $N \in 1, 2, 3, \ldots$ is the D218: Boolean function \begin{equation} \{ 0, 1 \}^N \to \{ 0, 1 \}, \quad x \mapsto I_{\sum_{n = 1}^N x_n \in 2 \mathbb{Z} + 1} \end{equation}
Formulation 2
The boolean parity function with respect to $N \in 1, 2, 3, \ldots$ is the D218: Boolean function \begin{equation} \{ 0, 1 \}^N \to \{ 0, 1 \}, \quad x \mapsto \begin{cases} 1, \quad & \sum_{n = 1}^N x_n \text{ is odd} \\ 0, \quad & \text{otherwise} \\ \end{cases} \end{equation}