I'm trying to figure this out:
Show that for all positive integers m and n
gcd(2m−1,2n−1)=2gcd(m,n)−1
I appreciate your help, Thanks.
Note: gcd stands for the greatest common divisor.
I have injection f:A→B and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...
No comments:
Post a Comment