Talk:Euclid's Lemma

Proof 2: Bézout's Lemma
Does 'Bézout's Lemma' warrant further justification? I mean, the converse is not true, even though the converse is true for coprime by this

Alternatively, I think we may change 'Bézout's Lemma' be instead Integer Combination of Coprime Integers. (Related: Talk:Integer Combination of Coprime Integers)


 * Bézout's Lemma as it stands says: given the gcd as this, we can create an integer combination like that. And that is how it is being used. Does the converse need to be true? I think not. --prime mover (talk) 09:59, 31 August 2018 (EDT)