Timeline for A back and forth Euclidean algorithm over the integers--does it have bounded length?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2014 at 19:37 | vote | accept | Pace Nielsen | ||
| Nov 11, 2014 at 16:55 | comment | added | Manny Reyes | Pace, you may also wish to look here regarding your account: meta.mathoverflow.net/q/15/778 | |
| Nov 11, 2014 at 0:33 | answer | added | S. Carnahan♦ | timeline score: 9 | |
| Nov 10, 2014 at 20:08 | comment | added | Emil Jeřábek | See mathoverflow.net/help/merging-accounts . | |
| Nov 10, 2014 at 19:44 | history | edited | Pace Nielsen | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 10, 2014 at 19:42 | comment | added | The Masked Avenger | Do you mean instead to express the fact that gcd(c,d) is 1? | |
| Nov 10, 2014 at 19:28 | comment | added | Pace Nielsen | Thanks! Technically, I have another account on here, but I don't have the log-in information anymore. (It would be great if an administrator could merge the two accounts.) | |
| Nov 10, 2014 at 18:46 | answer | added | Aaron Meyerowitz | timeline score: 2 | |
| Nov 10, 2014 at 17:40 | review | First posts | |||
| Nov 10, 2014 at 17:47 | |||||
| Nov 10, 2014 at 17:40 | history | asked | Pace Nielsen | CC BY-SA 3.0 |