# Common Divisor Divides Integer Combination/General Result

## Theorem

Let $c$ be a common divisor of a set of integers $A := \set {a_1, a_2, \dotsc, a_n}$.

That is:

$\forall x \in A: c \divides x$

Then $c$ divides any integer combination of elements of $A$:

$\forall x_1, x_2, \dotsc, x_n \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_n x_n}$

## Proof

The proof proceeds by induction.

For all $n \in \Z_{\ge 2}$, let $\map P n$ be the proposition:

$\forall x \in \set {a_1, a_2, \dotsc, a_n}: c \divides x \implies \forall x_1, x_2, \dotsc, x_n \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_n x_n}$

### Basis for the Induction

$\map P 2$ is the case:

$\forall x \in \set {a_1, a_2}: c \divides x \implies \forall x_1, x_2 \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2}$

This is demonstrated to be true in Common Divisor Divides Integer Combination.

Thus $\map P 2$ is seen to hold.

This is the basis for the induction.

### Induction Hypothesis

Now it needs to be shown that if $\map P k$ is true, where $k \ge 1$, then it logically follows that $\map P {k + 1}$ is true.

So this is the induction hypothesis:

$\forall x \in \set {a_1, a_2, \dotsc, a_k}: c \divides x \implies \forall x_1, x_2, \dotsc, x_k \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_k x_k}$

from which it is to be shown that:

$\forall x \in \set {a_1, a_2, \dotsc, a_k, a_{k + 1} }: c \divides x \implies \forall x_1, x_2, \dotsc, x_k, x_{k + 1} \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_k x_k + a_{k + 1} x_{k + 1} }$

### Induction Step

This is the induction step:

Let :

$\forall x \in \set {a_1, a_2, \dotsc, a_k, a_{k + 1} }: c \divides x$

We have that:

$c \divides a_{k + 1} \implies \forall x_{k + 1} \in \Z: c \divides a_{k + 1} x_{k + 1}$

and we have that:

$\forall x \in \set {a_1, a_2, \dotsc, a_k}: c \divides x \implies \forall x_1, x_2, \dotsc, x_k \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_k x_k}$

Let $x_1, x_2, \dotsc, x_k \in \Z$ be arbitrary.

Let $d = a_1 x_2 + a_2 x_2 + \dotsb + a_k x_k$.

Then:

 $\ds c$ $\divides$ $\ds cd$ $\, \ds \land \,$ $\ds c$ $\divides$ $\ds a_{k + 1}$ $\ds \leadsto \ \$ $\ds c$ $\divides$ $\ds \paren {1 \times d + x_{k + 1} a_{k + 1} }$ $\ds$ $=$ $\ds \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_k x_k + a_{k + 1} x_{k + 1} }$

But $x_1, x_2, \dotsc, x_k \in \Z$ are arbitrary, and so:

$\forall x \in \set {a_1, a_2, \dotsc, a_k, a_{k + 1} }: c \divides x \implies \forall x_1, x_2, \dotsc, x_k, x_{k + 1} \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_k x_k + a_{k + 1} x_{k + 1} }$

So $\map P k \implies \map P {k + 1}$ and the result follows by the Principle of Mathematical Induction.

Therefore:

$\forall n \in \Z_{\ge 2}: \forall x \in \set {a_1, a_2, \dotsc, a_n}: c \divides x \implies \forall x_1, x_2, \dotsc, x_n \in \Z: c \divides \paren {a_1 x_2 + a_2 x_2 + \dotsb + a_n x_n}$

$\blacksquare$
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 2, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://proofwiki.org/wiki/Common_Divisor_Divides_Integer_Combination/General_Result", "fetch_time": 1643054289000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-05/segments/1642320304600.9/warc/CC-MAIN-20220124185733-20220124215733-00261.warc.gz", "warc_record_offset": 514942386, "warc_record_length": 11056, "token_count": 1269, "char_count": 2930, "score": 4.34375, "int_score": 4, "crawl": "CC-MAIN-2022-05", "snapshot_type": "latest", "language": "en", "language_score": 0.5088089108467102, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00060-of-00064.parquet"}