Find $\gcd(47,6)$ using euclid's algorithm
I know that if $\gcd(a,b)=\gcd(b,r)$ where $a=qb+r$
So in there case $47=7\cdot6+5$ or $47=8\cdot6-1$ should I prefer finding prime numbers decomposition? will it make the process shorter?
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