Set of Integer Combinations includes Zero

Lemma

Let $a, b \in \Z$ be integers.

Let $S = \set {a x + b y: x, y \in \Z}$ be the set of integer combinations of $a$ and $b$.

Then $0 \in S$.

Proof

By setting $x = 0$ and $y = 0$:

$a \cdot 0 + b \cdot 0 = 0$

$\blacksquare$

Sources

• 1982: Martin Davis: Computability and Unsolvability (2nd ed.) ... (previous) ... (next): Appendix $1$: Some Results from the Elementary Theory of Numbers: Lemma $1$