Representing the GCD as linear combination in non-PID rings

Abstract: In this note we prove the following fact: if finite many elements

p_{1}, p_{2}, ..., p_{n}

of a unique factorization domain are given such that the greatest common divisor of each pair

(p_{i}, p_{j})

can be expressed as a linear combination of

p_{i}

and

p_{j}

then the greatest common divisor of all

p_{i}

s also can be expressed as a linear combination of

p_{1}, ..., p_{n}

. We prove am analogous statement in commutative rings.

Recommendations

Cites Work

Cited In (2)

This page was built for publication: Representing the GCD as linear combination in non-PID rings