Saturday, April 23, 2016

number theory - What is operatornamegcd(a,2a1)?

Intuitively, I feel it's 1, for example (2,3),(3,7) etc. But then I cannot go to prove it. Using the formula ax+by=c does not make sense because of the power.
Is it possible by induction? If I assume a=1, then gcd(1,211)=1 Assuming, it to be true for k, then



gcd(k,2k1)=1=kx+(2k1)y=1



I'm stuck here. Is it even possible with this method?

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...