Find $m,n\in \Bbb{Z}$ such that $\,\gcd(14565695, 61489) = m\cdot 14565695 + n\cdot 61489.$
I used the Euclidean Algorithm to show the gcd $=1.$ What way is there to solve such a question? I would appreciate your help.
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