Timeline for Average number of iterations for the Euclidean algorithm to terminate
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2019 at 8:41 | vote | accept | soupy | ||
| Sep 21, 2019 at 8:00 | comment | added | Alexey Ustinov | @soupy Yes, you need to apply Mobius inversion formula. But result will be not so nice-looking, see Knuth, Seminumerical Algorithms. | |
| Sep 21, 2019 at 7:53 | comment | added | soupy | These are really interesting results! I'm a bit embarrassed to not notice the connection to continued fractions. Correct me if I'm wrong, but I imagine it would not be difficult to get estimates for $\sum_{1\leq a<b} l(a/b)$ and not just for $(a,b)=1$. | |
| Sep 21, 2019 at 7:40 | history | answered | Alexey Ustinov | CC BY-SA 4.0 |