Timeline for When does $2$ arise when using the Euclidean algorithm to compute greatest common divisors?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4 at 18:05 | history | edited | Will Sawin | CC BY-SA 4.0 |
added 413 characters in body
|
| Jul 4 at 13:08 | history | edited | Emil Jeřábek | CC BY-SA 4.0 |
edited body
|
| Jul 4 at 8:02 | comment | added | Emil Jeřábek | One should be slightly careful in that $[0;a_n,\dots,a_1]$ is not necessarily in the canonical form for a rational continued fraction, as it may end with $1$. (This is why I wrote there are small exceptions to "$a_n=\lfloor a/u\rfloor$" in my comment elsewhere; your answer now makes it clear the exceptions happen when $a/b=[a_0;1,a_2]$.) | |
| Jul 4 at 0:25 | history | edited | Will Sawin | CC BY-SA 4.0 |
added 149 characters in body
|
| Jul 3 at 20:01 | history | edited | Will Sawin | CC BY-SA 4.0 |
added 807 characters in body
|
| Jul 3 at 19:54 | history | answered | Will Sawin | CC BY-SA 4.0 |