Show that gcd(2m−1,2n−1)=2gcd(m,n)−1 [duplicate]
Possible Duplicate: Prove that gcd(an−1,am−1)=agcd(n,m)−1 gcd(bx−1,by−1,bz−1,…)=bgcd(x,y,z,…)−1 I'm trying to figure this out: ...
Possible Duplicate: Prove that gcd(an−1,am−1)=agcd(n,m)−1 gcd(bx−1,by−1,bz−1,…)=bgcd(x,y,z,…)−1 I'm trying to figure this out: ...
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