I need a little help on this problem.....Prove that is a is a relatively prime to b and a>b then gcd(a^m-b^m,a^n-b^n)=a^gcd(m,n)-b^gcd(m,n) I am suppose to use the Euclidean algorithm thanks

Follow Math Help Forum on Facebook and Google+

Originally Posted by bugal402 I need a little help on this problem.....Prove that is a is a relatively prime to b and a>b then gcd(a^m-b^m,a^n-b^n)=a^gcd(m,n)-b^gcd(m,n) I am suppose to use the Euclidean algorithm thanks An idea (I haven't tried it myself but my guess is it should work) - Prove that if x|RHS => x|LHS and vice a versa

View Tag Cloud