▾ 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
▾ Set of rational numbers
▾ Set of euclidean rational numbers
▾ Set of euclidean integers
▾ Set of euclidean natural numbers
▾ Set of RGB colors
RGB color
Formulation 0
Let $x = (n, m, k) \in \mathbb{N}^3$ be a D5160: Euclidean natural number.
Then $x$ is an RGB color if and only if \begin{equation} n, m, k \in \{ 0, 1, 2, \ldots, 255 \} \end{equation}