Prove: If for some , then divides .
Follow Math Help Forum on Facebook and Google+
Originally Posted by Zennie Prove: If for some , then divides . By lemma of Euclid Algorithm: if gcd(a,b)= e then there exist m,n (integers) s.t. e= am+bn . Since gcd(a,b) is e. then a divides e. and b divides e?
View Tag Cloud