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

Results 1 to 2 of 2

- Apr 15th 2010, 07:56 PM #1

- Joined
- Apr 2010
- Posts
- 11

- Apr 16th 2010, 01:12 AM #2

- Joined
- Apr 2009
- Posts
- 678
- Thanks
- 1