[BB] For n ≥ 3, the greatest common divisor of n nonzero integers a1, a2, …, an can be defined inductively by
Prove that gcd(a1, a2, …, an) is an integral linear combination of a1, a2, …, an for all n ≥ 2; that is, prove that there exist integers s1,…,sn such that gcd(a1, …, an) =s1, a1 + s2, a2,+ …, sn an
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.