Sunday 20 October 2013

gcd and lcm - Bezout's identity: which half is larger?

Bezout's identity: Let a and b be integers with greatest common divisor d. Then, there exist integers x and y such that ax + by = d.



Is it true that if a > b then ax < by? Is there a proof for this?

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...