Timeline for Approximating $e$ with 2s and 3s
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 15, 2022 at 2:50 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
fixed arxiv front-end link, gave title, and link to published version
|
| Apr 11, 2011 at 16:46 | comment | added | Ale De Luca | The NICF of $e$ is $[3,-4,\overline{-2,2k+5}]_{k=0}^\infty$, but I'm not sure how one could use it. | |
| Mar 2, 2011 at 4:21 | history | edited | Kevin O'Bryant | CC BY-SA 2.5 |
added 32 characters in body
|
| Mar 2, 2011 at 2:02 | comment | added | Jérôme JEAN-CHARLES | There several different kind of constraint in terms of how well the limit is e. 1: increases strictly always to the limit, 2 : be as close as possible to the limit. In case 2 it is not clear if it should alternate? Nice interesting problem! | |
| Mar 1, 2011 at 22:57 | comment | added | Gerry Myerson | Presumably, one could use the nearest-integer version of the continued fraction [NICF] algorithm, but I don't know whether the NICF of $e$ has any pattern. | |
| Mar 1, 2011 at 17:52 | history | edited | Kevin O'Bryant | CC BY-SA 2.5 |
typo in formula
|
| Mar 1, 2011 at 14:29 | history | answered | Kevin O'Bryant | CC BY-SA 2.5 |