Timeline for Greatest common divisor of algebraic integers
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2022 at 8:13 | history | edited | CommunityBot |
replaced http://math.uga.edu/~pete with http://alpha.math.uga.edu/~pete
|
|
| Feb 17, 2011 at 20:16 | vote | accept | Esteban Crespi | ||
| Feb 17, 2011 at 6:55 | comment | added | Pete L. Clark | @Esteban: yes, I have done so. (These links may go down every once in a while, but I promise I will notice and rectify the situation within a day at the latest.) | |
| Feb 17, 2011 at 6:52 | comment | added | Esteban Crespi | @Pete, thanks for your answer but the link doesn't work. Can you fix it? | |
| Feb 17, 2011 at 4:10 | comment | added | Pete L. Clark | @Aaron: good question. Off the top of my head, I think I don't know: the proof I give does seem to give an algorithm to produce the GCD but does not seem to give an algorithm to express it as a linear combination of $a$ and $b$. Absent some kind of Euclidean property I can't think of what to do -- and it is not clear to me at the moment that there is some kind of Euclidean property here (the person to ask would be Franz Lemmermeyer). | |
| Feb 17, 2011 at 3:57 | comment | added | Aaron Meyerowitz | Once one has a linear combination which is a common divisor, that is indubitably a greatest common divisor. Is there a reasonable algorithm which will produce such a linear combination? Perhaps one needs to appeal to theory to prove that the algorithm will always succeed. | |
| Feb 16, 2011 at 23:32 | history | answered | Pete L. Clark | CC BY-SA 2.5 |