Art of Problem Solving

AoPS Online

Bezout's Lemma

Revision as of 12:46, 12 August 2008 by 1=2 (talk | contribs) (New page: '''Bezout's Lemma''' states that if two integers <math>x</math> and <math>y</math> satisfy <math>gcd(x,y)=1</math>, then there exist integers <math>\alpha</math> and <math>\beta</math> suc...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Bezout's Lemma states that if two integers $x$ and $y$ satisfy $gcd(x,y)=1$ , then there exist integers $\alpha$ and $\beta$ such that $x\alpha+y\beta=1$ .

Proof

Template:Incomplete

See also

This article is a stub. Help us out by expanding it.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Bezout%27s_Lemma&oldid=27397"

© 2024 AoPS Incorporated