Let a and b be two odd positive integers. Prove that gcd.
I tried rewriting it to get \gcd(2^{2k+1}+1,2^{\gcd(2k+1,2n+1)}-1), but I didn't see how this helps.
I have injection f \colon A \rightarrow 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