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?
Subscribe to:
Post Comments (Atom)
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment