Timeline for A back and forth Euclidean algorithm over the integers--does it have bounded length?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2014 at 21:05 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 1498 characters in body
|
| Nov 10, 2014 at 19:48 | comment | added | The Masked Avenger | It may be that the most convincing proof is to work backwards: find all pairs that reach the target in one step, then find all that reach the target in two steps, and so on. | |
| Nov 10, 2014 at 18:57 | comment | added | Pace Nielsen | "For the pair (70,99) the fastest descent is..." This might be silly to ask, but why is this the fastest descent? What is the proof? | |
| Nov 10, 2014 at 18:46 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |