Tuesday, December 1, 2015

elementary number theory - Show that gcd(2m1,2n1)=2gcd(m,n)1




I'm trying to figure this out:


Show that for all positive integers m and n


gcd(2m1,2n1)=2gcd(m,n)1



I appreciate your help, Thanks.


Note: gcd stands for the greatest common divisor.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...