I know the extended euclidean algorithm by working myself backward from the euclidean algorithm to find the GCD. I'm confused with the extended euclidean algorithm as given in this page. How is this process derived and why are we introducing new variables s and t? How is this process derived from working backwards with the standard euclidean algorithm? And how does the computation work now that we have $s_0, s_1, t_0, t_1$, which is neither intuitive nor any explanation is given anywhere.
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
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...
-
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 need to give an explicit bijection between $(0, 1]$ and $[0,1]$ and I'm wondering if my bijection/proof is correct. Using the hint tha...
-
Recently I took a test where I was given these two limits to evaluate: $\lim_\limits{h \to 0}\frac{\sin(x+h)-\sin{(x)}}{h}$ and $\lim_\limi...
No comments:
Post a Comment